Description - Boolean Function Complexity by M. S. Paterson
Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods. Here 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.
Buy Boolean Function Complexity by M. S. Paterson from Australia's Online Independent Bookstore, Boomerang Books.
(228mm x 152mm x 12mm)
Cambridge University Press
Publisher: Cambridge University Press
Country of Publication:
Book Reviews - Boolean Function Complexity by M. S. Paterson