Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: 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.