Olaf Beyersdorff
Broschiertes Buch

Non-classical Aspects in Proof Complexity

Versandkostenfrei!
Versandfertig in 1-2 Wochen
19,95 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
0 °P sammeln!
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...