Recomienda este artículo a tus amigos:
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides Peter Clote
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides
Peter Clote
This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.
442 pages, line figures
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 6 de mayo de 1993 |
| ISBN13 | 9780198536901 |
| Editores | Oxford University Press |
| Páginas | 442 |
| Dimensiones | 162 × 242 × 30 mm · 810 g |
| Lengua | Inglés |
| Editor | Clote, Peter (Professor, Department of Computer Science, Professor, Department of Computer Science, Boston College, Chestnut Hill, USA) |
| Editor | Krajicek, Jan (Mathematical Institute, Mathematical Institute, Ceskoslovenska Akademie Ved Praha 1, Czechoslovakia) |
Mas por Peter Clote
Mostrar todoMere med samme udgiver
Ver todo de Peter Clote ( Ej. Hardcover Book y Paperback Book )