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-offs

Authors: Jakob Nordstrom ORCID-iD

    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
    Accepted on: June 25, 2015
    Submitted on: March 30, 2010
    Keywords: Computer Science - Computational Complexity,Computer Science - Discrete Mathematics,Computer Science - Logic in Computer Science,Mathematics - Combinatorics,Mathematics - Logic
    Fundings :
      Source : OpenAIRE Research Graph
    • Understanding the Hardness of Theorem Proving; Funder: European Commission; Code: 279611

    Linked data

    Source : ScholeXplorer IsReferencedBy ARXIV 1311.2355
    Source : ScholeXplorer IsReferencedBy DOI 10.1137/16m1082007
    Source : ScholeXplorer IsReferencedBy DOI 10.1145/2591796.2591838
    • 10.1145/2591796.2591838
    • 10.1145/2591796.2591838
    • 10.1145/2591796.2591838
    • 10.1137/16m1082007
    • 10.1137/16m1082007
    • 1311.2355
    Communication lower bounds via critical block sensitivity
    Mika Göös ; Toniann Pitassi ;

    55 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 1289 times.
    This article's PDF has been downloaded 433 times.