Normal view MARC view ISBD view

Boolean function complexity

Boolean function complexity edited by M.S. Paterson - Cambridge Cambridge University Press 1992 - 201 p. : ill. ; 23 cm.

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)

ISBN: 521408261

ISSN: 93111192

Subjects--Topical Terms:
Algebra, Boolean
Computational complexity - Congresses

Dewey Class. No.: 511.324 PAT

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

Find us on the map