The complexity of boolean functions
Wegener I.
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:
1991
Editeur::
Wiley
Langue:
english
Pages:
470
ISBN 10:
0471915556
ISBN 13:
9780471915553
Collection:
Wiley Teubner on Applicable Theory in Computer Science
Fichier:
PDF, 1.56 MB
IPFS:
,
english, 1991