Cargando…

Logical foundations of proof complexity /

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. Associated with each of many complexity classes are bo...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Cook, Stephen, 1948-
Otros Autores: Nguyen, Phuong, 1977-
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Ithaca, NY : Cambridge University Press ; Association for Symbolic Logic, ©2010.
Colección:Perspectives in logic.
Temas:
Acceso en línea:Texto completo