๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of Boolean Functions

โœ Scribed by Wegener I.

Book ID
127450904
Year
1991
Tongue
English
Weight
2 MB
Category
Library

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

Compositional complexity of Boolean func
Compositional complexity of Boolean functions
โœ Harold Abelson; Andrzej Ehrenfeucht; James Fickett; Jan Mycielski ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 549 KB
The complexity of Boolean functions
The complexity of Boolean functions
โœ Ingo Wegener ๐Ÿ“‚ Library ๐Ÿ“… 1991 ๐Ÿ› Wiley ๐ŸŒ English โš– 842 KB

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 in