Дискретная математика

Список источников > Компьютерные науки > Дискретная математика

The Complexity of Boolean Functions

Автор: Wegener I.
Год: 1987
Издание: [не указано]
Страниц: [не указано]
ISBN: [не указан]
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.

Добавлено: 2009-08-09 01:26:35