Space in Weak Propositional Proof Systems - Ilario Bonacina
-20% with code BOOKS
Shipping in 10-16 days
30-day return policy
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 ... Full description
You May Also Like
TOP
AI for Good: How Real People Are Using Artificial Intelligence to Fix Things That Matter
-20% with code BOOKS
Out of stock
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-20% with code BOOKS
In stock at our supplier
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-20% with code BOOKS
In stock at our supplier
Description
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.
The book is appropriate for researchers in theoretical computer science, in particular computational complexity.
More Information
| Author | Ilario Bonacina |
|---|---|
| Publisher | Springer International Publishing |
| Release year | 2018 |
| Cover type | Hardcover |
| EAN | 9783319734521 |