Details
Space in Weak Propositional Proof Systems
|
53,49 € |
|
| Verlag: | Springer |
| Format: | |
| Veröffentl.: | 11.01.2018 |
| ISBN/EAN: | 9783319734538 |
| Sprache: | englisch |
Dieses eBook enthält ein Wasserzeichen.
Beschreibungen
<p>This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. </p><p><br></p><p>The book is appropriate for researchers in theoretical computer science, in particular computational complexity.</p>
Introduction.- Total Space in Resolution.- Space in Polynomial Calculus.- Space Lower Bounds: Applications.- A Postlude: SETH and Resolution Size.<p></p>
<p>Ilario Bonacina did his PhD at the Computer Science Department at Sapienza Università di Roma under the supervision of Nicola Galesi. After a postdoc in the Theoretical Computer Science Group at KTH Royal Institute of Technology (Stockholm), he is currently a postdoc in the Computer Science Department at Universitat Politècnica de Catalunya (Barcelona). His research interests include computational complexity and mathematical logic.</p>
This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory.<div><br></div><div>The book is appropriate for researchers intheoretical computer science, in particular computational complexity.</div>
Proof complexity is a research area that studies the concept of complexity from the point of view of logic Book offers a reader-friendly exposition of game-theoretic methods used in proof complexity Appropriate for researchers in theoretical computer science, in particular computational complexity
Diese Produkte könnten Sie auch interessieren:
