Complexity of Boolean Functions

Name: Complexity of Boolean Functions
Availability: OutOfStock
ISBN: 9780471915553

ISBN-10: 0471915556

ISBN-13: 9780471915553

Edition: 1987

Authors: Ingo Wegener

List price: $377.95

30 day, 100% satisfaction guarantee!

Out of stock

We're sorry. This item is currently unavailable.

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.

Book details

List price: $377.95
Copyright year: 1987
Publisher: John Wiley & Sons, Incorporated
Publication date: 1/8/1991
Binding: Hardcover
Pages: 470
Size: 6.50" wide x 9.31" long x 1.22" tall
Weight: 1.936



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