Boolean function complexity edited by M.S. Paterson

Contributor(s):

Paterson, Michael S

Publication details: Cambridge Cambridge University Press 1992Description: 201 p. : ill. ; 23 cmISBN:

521408261

ISSN:

93111192

Subject(s):

Algebra, Boolean
Computational complexity - Congresses

DDC classification:

511.324 PAT

Item type: Books

Tags from this library: No tags from this library for this title.

Average rating: 0.0 (0 votes)

Holdings
Current library	Call number	Status	Date due	Barcode
Anna Centenary Library	511.324 PAT (Browse shelf(Opens below))	Available		234430

Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society. Includes bibliographical references (p. 198-201)

There are no comments on this title.

to post a comment.

Print
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

Boolean function complexity edited by M.S. Paterson

Find us on the map