Tell your friends about this item:
Boolean Function Complexity - London Mathematical Society Lecture Note Series M S Paterson
Boolean Function Complexity - London Mathematical Society Lecture Note Series
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.
212 pages, some line drawings, some tables
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | November 5, 1992 |
| ISBN13 | 9780521408264 |
| Publishers | Cambridge University Press |
| Pages | 212 |
| Dimensions | 151 × 227 × 11 mm · 315 g |
| Language | English |
| Editor | Paterson, M. S. (University of Warwick) |