Proof Complexity
-
Form:Einzelkauf Download
-
Sprache:Englisch
-
eBook Format:PDF
- PDF Fr. 137.90 ausgewählt
- ePUB Fr. 115.90
Fr. 137.90
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Ja
Family Sharing
Ja
Text-to-Speech
Nein
Erscheinungsdatum
28.03.2019
Verlag
Cambridge University PressSeitenzahl
(Printausgabe)
Dateigröße
3461 KB
Sprache
Englisch
EAN
9781108271585
Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung