Skip to content Skip to footer
-70%

The Complexity of Boolean Functions by Ingo Wegener, ISBN-13: 978-0471915553

Original price was: $50.00.Current price is: $14.99.

 Safe & secure checkout

Description

Description

The Complexity of Boolean Functions by Ingo Wegener, ISBN-13: 978-0471915553

[PDF eBook eTextbook]

  • Publisher: ‎ Wiley; 1st edition (January 8, 1991)
  • Language: ‎ English
  • 470 pages
  • ISBN-10: ‎ 9780471915553
  • ISBN-13: ‎ 978-0471915553

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. 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.

Contents:

Introduction to the theory of Boolean functions and circuits

The minimization of Boolean functions

The design of efficient circuits for some fundamental functions

Asymptotic results and universal circuits

Lower bounds on circuit complexity

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

Hierarchie, mass production and reductions

Bounded-depth circuits

Synchronous, planar, and probabilistic circuits

PRAMs and WRAMs: Parallel random access machines

Pranching Programs

Ingo Wegener was an influential German computer scientist working in the field of theoretical computer science.

What makes us different?

• Instant Download

• Always Competitive Pricing

• 100% Privacy

• FREE Sample Available

• 24-7 LIVE Customer Support

Delivery Info

Reviews (0)

Reviews

There are no reviews yet.

Be the first to review “The Complexity of Boolean Functions by Ingo Wegener, ISBN-13: 978-0471915553”

Your email address will not be published. Required fields are marked *