Items related to Non-classical Aspects in Proof Complexity
Search results for Non-classical Aspects in Proof Complexity
Seller Image
Non-classical Aspects in Proof Complexity
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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. Seller Inventory # 9783954040360
Seller Image
Non-classical Aspects in Proof Complexity
Published by
Jentzsch-Cuvillier, Annette, 2012
ISBN 10: 3954040360
ISBN 13: 9783954040360
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnProof complexity focuses on the complexity of theorem proving procedures, antopic which is tightly linked to questions from computational complexity (thenseparation of complexity classes), first-order arithmetic theories (bounded . Seller Inventory # 119168033
Buy New
£ 17.58
£ 41.92 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Non-classical Aspects in Proof Complexity
Published by
Cuvillier, Cuvillier Mär 2012, 2012
ISBN 10: 3954040360
ISBN 13: 9783954040360
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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
Seller Image
Non-classical Aspects in Proof Complexity
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783954040360
Seller Image
Non-classical Aspects in Proof Complexity
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Non-classical Aspects in Proof Complexity | Olaf Beyersdorff | Taschenbuch | 140 S. | Englisch | 2012 | Cuvillier | EAN 9783954040360 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 104317589