Normal view MARC view ISBD view

Boolean Function Complexity [electronic resource]. / Edited by M. S. Paterson.

By: Paterson, M. S.
Material type: TextTextSeries: London Mathematical Society Lecture Note Series no. 169.Publisher: Cambridge : Cambridge University Press, 1992Description: 1 online resource (212 p.) : digital, PDF file(s).ISBN: 9780511526633 (ebook); 9780521408264 (paperback).Subject(s): Computational complexity -- Congresses | Algebra, BooleanAdditional physical formats: Print version: : No titleDDC classification: 511.324 Online resources: Access by subscription | Off-campus Also issued in print format.
Reviews from LibraryThing.com:
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Electronic Book Electronic Book Prof. G. K. Chadha Library

South Asian University

511.324 (Browse shelf) Not for loan eb00000069
Total holds: 0

Title from publishers bibliographic system (viewed on 11 Jan 2013).

Also issued in print format.

Mode of access: World Wide Web.

Open Library:

Powered by Koha

//