The Complexity of Boolean Functions
Ingo Wegener
Presents 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.
Catégories:
Année:
1987
Editeur::
Johann Wolfgang Goethe-Universit¨at
Langue:
english
Pages:
469
Fichier:
PDF, 1.88 MB
IPFS:
,
english, 1987