ENGLISH

The Complexity of Boolean Functions

By Ingo Wegener

Book information

Publisher
Wiley
Year
1987
ISBN
0471915556, 3519021072
Language
english
Format
DJVU
Filesize
2 MB (2487418 bytes)
Pages
\469
Time added
2022-07-31 12:02:22

Description

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

Similar books