The Complexity of Boolean Functions 1987 PDF
468 Pages·1987·3.049 MB·English
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
Preview The Complexity of Boolean Functions 1987
Description:
Book DescriptionPresents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises. SynopsisResearch 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.
See more
The list of books you might like
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
