Clique em uma foto para ir ao Google Livros
Carregando... Logical foundations of proof complexityde Stephen Cook
Sem etiquetas Nenhum(a) Carregando...
Registre-se no LibraryThing tpara descobrir se gostará deste livro. Ainda não há conversas na Discussão sobre este livro. Sem resenhas sem resenhas | adicionar uma resenha
Pertence à série
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 both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P. Não foram encontradas descrições de bibliotecas. |
Current DiscussionsNenhum(a)
Google Books — Carregando... GênerosClassificação decimal de Dewey (CDD)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicClassificação da Biblioteca do Congresso dos E.U.A. (LCC)AvaliaçãoMédia: Sem avaliação.É você?Torne-se um autor do LibraryThing. |