 The Complexity of Boolean Functions
ISBN: 978-0-471-91555-3
Hardcover
470 pages
January 1991
US $325.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 1-2 days delivery time for paperbacks, and 3-5 days for hardcovers. The book is not returnable.
|
Introduction to the Theory of Boolean Functions and Circuits.
The Minimimization of Boolean Functions.
The Design of Efficient Circuits for Some Fundamental Functions.
Asymptotic Results and Universal Circuits.
Lower Bounds on Circuit Complexity.
Monotone Circuits.
Relations between Circuit Size, Formula Size and Depth.
Formula Size.
Circuits and other Non-Uniform Computation Methods vs.
Turing Machines and other Uniform Computation Models.
Hierarchies, Mass Production, and Reductions.
Bounded-Depth Circuits.
Synchronous, Planar, and Probabilistic Circuits.
PRAMs and WRAMs: Parallel Random Access Machines.
Branching Programs.
References.
Index.
;){kind=link}