The PSPACE-Completeness of Black-White Pebbling

Authors:
Philipp Hertel;Toniann Pitassi
Affiliations:
philipp@cs.toronto.edu and toni@cs.toronto.edu;-
Venue:
SIAM Journal on Computing
Year:
2010

Citing 11
Cited 0

White pebbles help

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
On the power of white pebbles

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Space bounds for resolution

Information and Computation
Introduction to the Theory of Computation

Introduction to the Theory of Computation
A PSPACE Complete Problem Related to a Pebble Game

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Variations of a pebble game on graphs

Variations of a pebble game on graphs
Size-Space Tradeoffs for Resolution

SIAM Journal on Computing
Narrow Proofs May Be Spacious:Separating Space and Width in Resolution

SIAM Journal on Computing
Storage requirements for deterministic polynomialtime recognizable languages

Journal of Computer and System Sciences
Game characterizations and the PSPACE-completeness of tree resolution space

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete.