Recomienda este artículo a tus amigos:
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 5 de noviembre de 1992 |
| ISBN13 | 9780521408264 |
| Editores | Cambridge University Press |
| Páginas | 212 |
| Dimensiones | 151 × 227 × 11 mm · 315 g |
| Lengua | Inglés |
| Editor | Paterson, M. S. (University of Warwick) |