Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169) (Volume 0) - Softcover

Book 155 of 387: London Mathematical Society Lecture Notes
 
9780521408264: Boolean Function Complexity (London Mathematical Society Lecture Note Series, Series Number 169) (Volume 0)
Softcover
ISBN 10: 0521408261 ISBN 13: 9780521408264
Publisher: Cambridge University Press, 1992

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
1992
Language
English
ISBN 10 
0521408261
ISBN 13 
9780521408264
Binding
Paperback
Edition number
1
Number of pages
212
Editor
Paterson M. S.