Wegener I. — The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
Обсудите книгу на
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
Автор: 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
|
|
О проекте