The Complexity of Boolean Functions

Ingo Wegener

ISBN 10: 0471915556 / ISBN 13: 9780471915553

Edité par John Wiley, 1987

A propos de cet article

A clean, bright and crisp hardback copy without a dust jacket-as issued. No previous ownership names. There is a tiny bit of creasing at the head and tail of the spine, but overall this is a very fresh and attractive copy. N° de réf. du vendeur ABE-1677498780970

Détails bibliographiques

Titre : The Complexity of Boolean Functions

Éditeur : John Wiley

Date d'édition : 1987

Reliure : Hardcover

Etat : Near Fine

A propos de ce titre

Synopsis :

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.

À propos de l?auteur:

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