Jakob Nordstrom - Pebble Games, Proof Complexity, and Time-Space Trade-offs

lmcs:1111 - Logical Methods in Computer Science, September 13, 2013, Volume 9, Issue 3 - https://doi.org/10.2168/LMCS-9(3:15)2013
Pebble Games, Proof Complexity, and Time-Space Trade-offsArticle

Authors: Jakob Nordstrom ORCID

    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.


    Volume: Volume 9, Issue 3
    Published on: September 13, 2013
    Imported on: March 30, 2010
    Keywords: Computer Science - Computational Complexity,Computer Science - Discrete Mathematics,Computer Science - Logic in Computer Science,Mathematics - Combinatorics,Mathematics - Logic
    Funding:
      Source : OpenAIRE Graph
    • Understanding the Hardness of Theorem Proving; Funder: European Commission; Code: 279611

    56 Documents citing this article

    Consultation statistics

    This page has been seen 2330 times.
    This article's PDF has been downloaded 625 times.