The Complexity of Boolean Functions / Edition 1

The Complexity of Boolean Functions / Edition 1

by Ingo Wegener
     
 

ISBN-10: 0471915556

ISBN-13: 9780471915553

Pub. Date: 01/16/1991

Publisher: Wiley

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 details below

Overview

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.

Product Details

ISBN-13:
9780471915553
Publisher:
Wiley
Publication date:
01/16/1991
Series:
Wiley Teubner on Applicable Theory in Computer Science Series, #3
Edition description:
New Edition
Pages:
470
Product dimensions:
1.19(w) x 9.00(h) x 6.00(d)

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.

References.

Index.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >