Items related to LMS: 169 Boolean Function Complexty (London Mathematical...

LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series, Series Number 169) - Softcover

Book 155 of 387: London Mathematical Society Lecture Notes

Paterson, M. S.

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

Synopsis

Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.

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

Book Description

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.

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