product iamge

The Complexity of Boolean Functions

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Ingo Wegener
Publisher: Wiley
Year: 1987

Language: english

Title page
Preface
Contents (detailed)
1 INTRODUCTION TO THE THEORY OF BOOLEAN FUNCTIONS AND CIRCUITS
2 THE MINIMIZATION OF BOOLEAN FUNCTIONS
3 THE DESIGN OF EFFICIENT CIRCUITS FOR SOME FUNDAMENTAL FUNCTIONS
4 ASYMPTOTIC RESULTS AND UNIVERSAL CIRCUITS
5 LOWER BOUNDS ON CIRCUIT COMPLEXITY
6 MONOTONE CIRCUITS
7 RELATIONS BETWEEN CIRCUIT SIZE, FORMULA SIZE AND DEPTH
8 FORMULA SIZE
9 CIRCUITS AND OTHER NON UNIFORM COMPUTATION MODELS VS. TURING MACHINES AND OTHER UNIFORM COMPUTATION MODELS
10 HIERARCHIES, MASS PRODUCTION AND REDUCTIONS
11 BOUNDED - DEPTH CIRCUITS
12 SYNCHRONOUS, PLANAR AND PROBABILISTIC CIRCUITS
13 PRAMs AND WRAMs: PARALLEL RANDOM ACCESS MACHINES
14 BRANCHING PROGRAMS
References
Index