Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World


How many flights will arrive to a particular airport? Click here to find out.
 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
 ISBN10: 0471915556
 ISBN13: 9780471915553
 Share This:
Book Description
Research on the complexity of Boolean functions in nonuniform 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 weeknown 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.
About the Authors N/A
:






















