ebook luisterboek
{{model.bookDetails.author}} Serie: {{model.bookDetails.series}} ({{model.bookDetails.seriesNumber}}) | Taal: {{model.bookDetails.language}}


€ {{model.bookDetails.refPriceMaxText}}

€ {{model.bookDetails.priceInCents}}

€ {{model.bookDetails.mainCopy.copyHasRegularPrice}}

€ {{model.bookDetails.priceInCents}}

Niet leverbaar

Non-classical Aspects in Proof Complexity


€ {{model.bookDetails.priceInCents}}

Dit artikel kunt u momenteel niet bestellen. Mogelijk is het wel op voorraad bij een van de aangesloten boekhandels. Bekijk de winkelvoorraad hieronder ↓
Direct te downloaden
Uw bibliotheek altijd beschikbaar in uw account
Gemakkelijk synchroniseren met geselecteerde apps
Nieuwe boeken gratis bezorgd vanaf € 17,50 naar NL*
Altijd de laagste prijs voor nieuwe Nederlandstalige boeken
Ruilen of retourneren binnen 14 dagen
Koop lokaal, ook online!
Op voorraad bij: {{model.bookDetails.physicalShopsWithStock[0].Name}}
Bekijk winkelvoorraad
Ik wil advies
Vraag de boekhandel
Prijsvoordeel *

Proof complexity focuses on the complexity of theorem proving procedures, a topic 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.
{{review.createdOn | date: 'dd-MM-yyyy' }} door {{review.reviewAlias}}
Meer Recensies
Lees minder
Geen recensies beschikbaar.

{{webshopCopy.binding == null || webshopCopy.binding == '' ? 'Prijs' : webshopCopy.binding}} € {{webshopCopy.priceInCentsText}}


Prijs € {{usedCopy.priceInCentsText}}

Conditie: {{usedCopy.qualityName}}
Leverbaar bij:
pro-mbooks2 : libris