The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)

Ingo Wegener

ISBN 10: 0471915556 / ISBN 13: 9780471915553

Edité par Wiley, 1991

Ancien livre de bibliothèque avec équipements. Couverture différente. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Different cover. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur G-122-139

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.

Détails bibliographiques

Titre : The Complexity of Boolean Functions (Wiley ...
Éditeur : Wiley
Date d'édition : 1991
Reliure : Hardcover
Etat : Bon