๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

The complexity of Boolean functions

โœ Scribed by Ingo Wegener

Publisher
Wiley
Year
1991
Tongue
English
Leaves
469
Series
Wiley Teubner on Applicable Theory in Computer Science
Category
Library
โฌ‡  Acquire This Volume

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

Complexity of Boolean Functions
๐Ÿ“ Complexity of Boolean Functions
โœ Wegener I. ๐Ÿ“‚ Library ๐Ÿ“… 1991 ๐ŸŒ English

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

The complexity of boolean functions
๐Ÿ“ The complexity of boolean functions
โœ Wegener I. ๐Ÿ“‚ Library ๐Ÿ“… 1991 ๐Ÿ› Wiley ๐ŸŒ English

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

Boolean Function Complexity
๐Ÿ“ Boolean Function Complexity
โœ M. S. Paterson ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The

Boolean Function Complexity
๐Ÿ“ Boolean Function Complexity
โœ M. S. Paterson ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The

Boolean Function Complexity
๐Ÿ“ Boolean Function Complexity
โœ M. S. Paterson ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The