Pebble Games, Proof Complexity, and Time-Space Trade-offs
Computational Complexity
2015-07-01 v3 Discrete Mathematics
Logic in Computer Science
Combinatorics
Logic
Abstract
Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. This is a survey of research in proof complexity drawing on results and tools from pebbling, with a focus on proof space lower bounds and trade-offs between proof size and proof space.
Keywords
Cite
@article{arxiv.1307.3913,
title = {Pebble Games, Proof Complexity, and Time-Space Trade-offs},
author = {Jakob Nordstrom},
journal= {arXiv preprint arXiv:1307.3913},
year = {2015}
}