Call Boomerang Books 1300 36 33 32

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.

Book Details

ISBN: 9780521408264
ISBN-10: 0521408261
Format: Paperback
(228mm x 152mm x 12mm)
Pages: 212
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 5-Nov-1992
Country of Publication: United Kingdom

Book Reviews - Boolean Function Complexity by M. S. Paterson

» Have you read this book? We'd like to know what you think about it - write a review about Boolean Function Complexity book by M. S. Paterson and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review