Non-classical Aspects in Proof Complexity

Lingua: inglese

Editore: Cuvillier Mrz 2012, 2012

3954040360 / 9783954040360

Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

Venditore con 5 stelle

Venditore AbeBooks dal 11 gennaio 2012

Brossura

Condizione: Nuovo

EUR 19,95

EUR 23,00 spedizione 
Spedito da Germania a U.S.A.

Quantità: 2 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

This item is printed on demand - it takes 3-4 days longer - Neuware -Proof complexity focuses on the complexity of theorem proving procedures, atopic which is tightly linked to questions from computational complexity (the separation of complexity classes), first-order arithmetic theories (bounded arithmetic), and practical questions as automated theorem proving. One fascinating question in proof complexity is whether powerful computational resources as randomness or oracle access can shorten proofs or speed up proof search. In this dissertation we investigated these questions for proof systems that use a limited amount of non-uniform information (advice). This model is very interesting as¿- in contrast to the classical setting¿-it admits an optimal proof system as recently shown by Cook and Krajícek. We give a complete complexity-theoretic classification of all languages admitting polynomially bounded proof systems with advice and explore whether the advice can be simplified or even eliminated while still preserving the power of the system. Propositional proof systems enjoy a close connection to bounded arithmetic. Cook and Krajícek (JSL¿07) use the correspondence between proof systems with advice and arithmetic theories to obtain a very strong Karp-Lipton collapse result in bounded arithmetic: if SAT has polynomial-size Boolean circuits, then the polynomial hierarchy collapses to the Boolean hierarchy. Here we show that this collapse consequence is in fact optimal with respect to the theory PV, thereby answering a question of Cook and Krajícek. The second main topic of this dissertation is parameterized proof complexity, a paradigm developed by Dantchev, Martin, and Szeider (FOCS¿07) which transfers the highly successful approach of parameterized complexity to the study of proof lengths. In this thesis we introduce a powerful two player game to model and study the complexity of proofs in a tree-like Resolution system in a setting arising from parameterized complexity. This game is also applicable to show strong lower bounds in other tree-like proof systems. Moreover, we obtain the first lower bound to the general dag-like Parameterized Resolution system for the pigeonhole principle and study a variant of the DPLL algorithm in the parameterized setting. 140 pp. Englisch.…

Dati bibliografici

Titolo
Non-classical Aspects in Proof Complexity
Autore
Olaf Beyersdorff
Editore
Cuvillier Mrz 2012
Anno di pubblicazione
2012
Condizione
Neu
Rilegatura
Taschenbuch
Lingua
inglese
ISBN 10
3954040360
ISBN 13
9783954040360
Peso dell'articolo
192 grammi
Dimensioni
210x148x7 mm

BuchWeltWeit Ludwig Meier e.K.

Bergisch Gladbach, Germania

Venditore con 5 stelle

Venditore AbeBooks dal 11 gennaio 2012

Tariffe di spedizione da Germania a U.S.A.

ArticoloDa 5 a 15 giorni lavorativiDa 5 a 15 giorni lavorativi
Primo articoloEUR 23,00EUR 23,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Assegno
  • Bonifico bancario
  • PayPal

Informazioni sull’azienda del venditore

BuchWeltWeit Ludwig Meier e.K.

Germania

BuchWeltWeit Inh. Ludwig Meier e.K.
Inhaber: Ludwig Meier
De-Gasperi-Str. 8
51469 Bergisch Gladbach
Deutschland

Tel.: +49(0)22028659300
Fax: +49(0)22028659301
E-Mail: info@buchweltweit.de

Registergericht: Amtsgericht Köln
Registernummer: HRA 28253

Umsatzsteuer-Identifikationsnummer: DE815259907

Wir sind zur Teilnahme an einem Streitbeilegungsverfahren vor einer Verbraucherschlichtungsstelle weder verpflichtet noch bereit.