Recomienda este artículo a tus amigos:
Logical Foundations of Proof Complexity Cook, Stephen (University of Toronto)
Logical Foundations of Proof Complexity
Cook, Stephen (University of Toronto)
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.
496 pages, 17 b/w illus. 5 tables
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 25 de enero de 2010 |
| ISBN13 | 9780521517294 |
| Editores | Cambridge University Press |
| Páginas | 496 |
| Dimensiones | 156 × 234 × 32 mm · 940 g |
| Lengua | Inglés |