The Complexity of Boolean Functions
John Wiley & Sons Inc (Verlag)
978-0-471-91555-3 (ISBN)
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.
Ingo Wegener was an influential German computer scientist working in the field of theoretical computer science.
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.
Erscheint lt. Verlag | 22.7.1987 |
---|---|
Reihe/Serie | Wiley Teubner on Applicable Theory in Computer Science |
Verlagsort | New York |
Sprache | englisch |
Maße | 153 x 237 mm |
Gewicht | 880 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
ISBN-10 | 0-471-91555-6 / 0471915556 |
ISBN-13 | 978-0-471-91555-3 / 9780471915553 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich