Conte aos seus amigos sobre este 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
| Mídia | Livros Paperback Book (Livro de capa flexível e brochura) |
| Lançado | 5 de novembro de 1992 |
| ISBN13 | 9780521408264 |
| Editoras | Cambridge University Press |
| Páginas | 212 |
| Dimensões | 151 × 227 × 11 mm · 315 g |
| Idioma | Inglês |
| Editor | Paterson, M. S. (University of Warwick) |