Research on the complexity of Boolean Functions in non- uniform computation models is now one of the most interesting and important areas of research in theoretical computer science. It has a direct relevance to practical problems in the Computer Aided Design of digital circuits. In this book Professor Dr Wegener presents a large number of recent research results for the first time. Initially he deals with the well-known computation models (circuits and formulae), and he goes on to special types of circuits, parallel computers, and branching programs. Basic results are included as well as the most recent research results. The Complexity of Boolean Functions assumes a basic knowledge of computer science and mathematics. It deals with both efficient algorithms and lower bounds. At the end of each chapter there are exercises with varying levels of difficulty to help students using the book.
The Minimimization of Boolean Functions.
The Design of Efficient Circuits for Some Fundamental Functions.
Asymptotic Results and Universal Circuits.
Lower Bounds on Circuit Complexity.
Relations between Circuit Size, Formula Size and Depth.
Circuits and other Non-Uniform Computation Methods vs.
Turing Machines and other Uniform Computation Models.
Hierarchies, Mass Production, and Reductions.
Synchronous, Planar, and Probabilistic Circuits.
PRAMs and WRAMs: Parallel Random Access Machines.
Series: Wiley Teubner on Applicable Theory in Computer Science
Audience: Tertiary; University or College
Number Of Pages: 470
Published: 8th January 1991
Publisher: John Wiley and Sons Ltd
Country of Publication: GB
Dimensions (cm): 23.65 x 16.5 x 3.11
Edition Number: 1