Logical Foundations of Proof Complexity (PDF)
(Sprache: Englisch)
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated...
Leider schon ausverkauft
eBook
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Logical Foundations of Proof Complexity (PDF)“
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
Bibliographische Angaben
- Autoren: Stephen Cook , Phuong Nguyen
- 2010, Englisch
- Verlag: Cambridge University Press
- ISBN-10: 1107206715
- ISBN-13: 9781107206717
- Erscheinungsdatum: 25.01.2010
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Ohne Kopierschutz
Sprache:
Englisch
Kommentar zu "Logical Foundations of Proof Complexity"
0 Gebrauchte Artikel zu „Logical Foundations of Proof Complexity“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Logical Foundations of Proof Complexity".
Kommentar verfassen