𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Boolean Function Complexity

✍ Scribed by M. S. Paterson


Publisher
Cambridge University Press
Year
1992
Tongue
English
Leaves
211
Series
London Mathematical Society Lecture Note Series
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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 list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists working in related areas.

✦ Subjects


ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ДискрСтная ΠΌΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;


πŸ“œ SIMILAR VOLUMES


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
✍ 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

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
✍ 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