
The Complexity of Boolean Functions
Ingo Wegener(Author)
Wiley (Publisher)
Published on 22. July 1987
Book
Hardback
470 pages
978-0-471-91555-3 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Chichester
United Kingdom
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 237 mm
Width: 153 mm
Thickness: 33 mm
Weight
880 gr
ISBN-13
978-0-471-91555-3 (9780471915553)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Ingo Wegener was an influential German computer scientist working in the field of theoretical computer science.
Content
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.