Normal view MARC view ISBD view

Boolean function complexity /

Boolean function complexity / edited by M.S. Paterson. - Cambridge ; New York, NY, USA : Cambridge University Press, 1992. - 201 p. : ill. ; 23 cm. - London Mathematical Society lecture note series ; 169 .

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: 0521408261

LCCN: 93111192

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

LC Class. No.: QA 267.7 / .B66 1992

Dewey Class. No.: 511.3/24

Place hold
Print
Cite
Add to your cart (remove)
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)

WELCOME TO MOI UNIVERSITY LIBRARY SERVICES

Boolean function complexity /