• Title The Complexity of Boolean Functions
• Author(s) Ingo Wegener
• Publisher: Wiley; 1 edition (January 16, 1991)
• Hardcover: 470 pages
• eBook: Online, PDF, 1.9 MB
• Language: English
• ISBN-10: 0471915556
• ISBN-13: 978-0471915553
• Share This:  

Book Description

Research on the complexity of Boolean functions in non-uniform computation models is now part of one of the most interesting and important areas in theoretical computer science. It has a direct relevance to practical problems in the computer aided design of digital circuits.

This book presents a large number of recent research results f Boolean functions 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.

• N/A

• Amazon

• Computational Complexity
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Parallel Computing and Programming
• Mathematical Logic - Set Theory, Model Theory, Computability, etc

• The Complexity of Boolean Functions (Ingo Wegener)

• Think Complexity: Science and Modeling, 2nd Ed. (Allen Downey)
• Complexity Theory: A Modern Approach (Sanjeev Arora, et al)
• Computability and Complexity: From a Programming Perspective
• Mathematics and Computation (Avi Wigderson)