The Complexity of Boolean Functions - Couverture rigide

Wegener, Ingo

Couverture rigide

ISBN 10 : 0471915556 ISBN 13 : 9780471915553

Editeur : John Wiley & Sons Ltd, 1987

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.

A propos du livre

À propos de l?auteur

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

Détails de l'édition

• Éditeur: John Wiley & Sons Ltd
• Date d'édition: 1987
• Langue: anglais
• ISBN 10: 0471915556
• ISBN 13: 9780471915553
• Reliure: Relié
• Nombre de pages: 470
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible