Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Logical Foundations of Proof Complexity

Name: Logical Foundations of Proof Complexity
Brand: Cambridge University Press
SKU: 04092227
Price: 138.58 EUR
Availability: InStock
Author: Stephen Cook
ISBN: 9780521517294

Stephen Cook

Língua

Inglês

Livro Livro de capa dura

Código Libristo: 04092227

Editoras Cambridge University Press, janeiro 2010

This book treats bounded arithmetic and propositional proof complexity from the point of view of com... Descrição completa

Código Libristo: 04092227

335 b

138.58 €

Armazenamento externo Envio em 14-21 dias

Até 30 dias para devoluções

Os clientes também compraram

Top Secret - Die Ultimative Offshore Bibel Dr. Goldmann

Capa mole

19.92 €

Panorama francouzské literatury od počátku po současnost Jiří Šrámek

Livro de capa dura

26.80 €

Hell Divers - Buch 3 Michael Krug

Livro de capa dura

19.41 €

Los Hombres Me Explican Cosas Rebecca Solnit

Capa mole

9.90 €

Politische Profile Leo Trotzki

Capa mole

16.98 €

Circo, o Losantos

Livro de capa dura

11.93 €

Kunstdenkmaler des christlichen Mittelalters in den Rheinlanden Ernst Ausm Weerth

Capa mole

15.26 €

Einf hrung in Grundbegriffe Und Grundfragen Der Erziehungswissenschaft Heinz-Hermann Krüger

Capa mole

33.17 €

Aufstieg und Fall der Mätresse im Europa des 18. Jahrhunderts Thomas Kuster

Capa mole

38.43 €

Grammaire Progressive du français Maïa Grégoire

Capa mole

31.45 €

Lesebuch John Meisser

Capa mole

10.92 €

L'Enterprise Risk Management et sa mise en place Mohamed Lamine Hammaz

Capa mole

55.12 €

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.