The Complexity of Boolean Functions
Overview & Synopsis
Research on the complexity of Boolean functions in non-uniform computation models is now part of one of the most interesting and important areas in theoretical computer science. It has a direct relevance to practical problems in the computer aided design of digital circuits.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | The Complexity of Boolean Functions |
|---|---|
| Author / Organization | Ingo Wegener |
| Subject & Discipline | Computational Complexity, Algorithms and Data Structures, Computational and Algorithmic Mathematics, Parallel Computing and Programming, Mathematical Logic - Set Theory, Model Theory, Computability, etc |
| Categories | Computational Complexity |
| ISBN | 0471915556 |
| Resource Verification | ✓ Verified Direct PDF Available |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Reported File Size | 1 KB (1,025 bytes) |
| Language | ENGLISH |
| Catalog ID | DOC-74692 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
The Complexity of Boolean Functions • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.