Normal view MARC view ISBD view

Boolean Function Complexity

Boolean Function Complexity - Berlin, Heidelberg Springer Berlin Heidelberg 2012.

Mathematics and Statistics (Springer-11649)

ISBN: 9783642245084, 978-3-642-24508-4

Subjects--Topical Terms:
Information and Communication, Circuits
Combinatorics
Combinatorics
Computer science
Information theory
Mathematics
Mathematics
Mathematics of Computing
Theory of Computation

Dewey Class. No.: 519, / 23

Print
Add to your cart (remove)
Suggest for purchase
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

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