The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
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.
వర్గాలు:
సంవత్సరం:
1991
ప్రచురణకర్త:
Wiley
భాష:
english
పేజీల సంఖ్య:
469
ISBN 10:
3519021072
ISBN 13:
9783519021070
పుస్తక శ్రేణి:
Wiley Teubner on Applicable Theory in Computer Science
ఫైల్:
PDF, 1.88 MB
IPFS:
,
english, 1991