• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Boolean Function Complexity

Boolean Function Complexity

Paperback

Series: London Mathematical Society Lecture Note, Book 169

AlgebraGeneral Computers

ISBN10: 0521408261
ISBN13: 9780521408264
Publisher: Cambridge University Press
Published: Nov 5 1992
Pages: 212
Weight: 0.70
Height: 0.48 Width: 6.00 Depth: 9.00
Language: 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 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.

Also in

General Computers