Non-classical Aspects in Proof Complexity

Language: English

Published by Cuvillier, Cuvillier Mär 2012, 2012

3954040360 / 9783954040360

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

Softcover

Condition: New

£ 17.39

£ 50.79 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Proof complexity focuses on the complexity of theorem proving procedures, atopic which is tightly linked to questions from computational complexity (theseparation of complexity classes), first-order arithmetic theories (bounded arithmetic)and practical questions as automated theorem proving. One fascinatingquestion in proof complexity is whether powerful computational resources as randomnessor oracle access can shorten proofs or speed up proof search. In thisdissertation we investigated these questions for proof systems that use a limitedamount of non-uniform information (advice). This model is very interesting asin contrast to the classical setting--it admits an optimal proof system as recentlyshown by Cook and Krajícek. We give a complete complexity-theoretic classificationof all languages admitting polynomially bounded proof systems with adviceand explore whether the advice can be simplified or even eliminated while stillpreserving 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 withadvice and arithmetic theories to obtain a very strong Karp-Lipton collapse resultin bounded arithmetic: if SAT has polynomial-size Boolean circuits, then thepolynomial hierarchy collapses to the Boolean hierarchy. Here we show that thiscollapse consequence is in fact optimal with respect to the theory PV, therebyanswering a question of Cook and Krajícek.The second main topic of this dissertation is parameterized proof complexity, aparadigm developed by Dantchev, Martin, and Szeider (FOCS'07) which transfersthe highly successful approach of parameterized complexity to the study of prooflengths. In this thesis we introduce a powerful two player game to model andstudy the complexity of proofs in a tree-like Resolution system in a setting arisingfrom parameterized complexity. This game is also applicable to show stronglower bounds in other tree-like proof systems. Moreover, we obtain the first lowerbound to the general dag-like Parameterized Resolution system for the pigeonholeprinciple and study a variant of the DPLL algorithm in the parameterized setting.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 140 pp. Englisch.…

Seller Inventory # 9783954040360

Bibliographic details

Title
Non-classical Aspects in Proof Complexity
Author
Olaf Beyersdorff
Publisher
Cuvillier, Cuvillier Mär 2012
Publication year
2012
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3954040360
ISBN 13
9783954040360
Item weight
192 grams
Dimensions
210x148x8 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 50.79£ 63.48
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany