+612 9045 4394
 
CHECKOUT
The Complexity of Boolean Functions : Wiley Teubner on Applicable Theory in Computer Science - Ingo Wegener

The Complexity of Boolean Functions

Wiley Teubner on Applicable Theory in Computer Science

Hardcover

Published: 8th January 1991
Ships: 7 to 10 business days
7 to 10 business days
RRP $852.95
$751.75
12%
OFF
or 4 easy payments of $187.94 with Learn more

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.

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.

ISBN: 9780471915553
ISBN-10: 0471915556
Series: Wiley Teubner on Applicable Theory in Computer Science
Audience: Tertiary; University or College
Format: Hardcover
Language: English
Number Of Pages: 470
Published: 8th January 1991
Country of Publication: GB
Dimensions (cm): 23.65 x 16.5  x 3.11
Weight (kg): 0.82
Edition Number: 1