Boolean Function Complexity (London Mathematical Society Lecture Note Series)

Book 155 of 387: London Mathematical Society Lecture Notes
 
9780511526633: Boolean Function Complexity (London Mathematical Society Lecture Note Series)
ISBN 10: 0511526636 ISBN 13: 9780511526633
Publisher: Cambridge University Press, 2009

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.

"synopsis" may belong to another edition of this title.

Book Description

Papers from the 1990 Durham symposium on Boolean function complexity reveal exciting advances over recent years in a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
2009
Language
English
ISBN 10 
0511526636
ISBN 13 
9780511526633
Binding
Printed Access Code
Editor
Paterson M. S.

Other Popular Editions of the Same Title

9780521408264: Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169)

Featured Edition

ISBN 10:  0521408261 ISBN 13:  9780521408264
Publisher: Cambridge University Press, 1992
Softcover