Print this page Share

The Complexity of Boolean Functions

ISBN: 978-0-471-91555-3
470 pages
January 1991, ©1987
The Complexity of Boolean Functions (0471915556) cover image


Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.
See More

Table of Contents

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.



See More

Related Titles

Back to Top