The pebbling problem is complete in polynomial space

Authors:
John R. Gilbert;Thomas Lengauer;Robert Endre Tarjan
Affiliations:
-;-;-
Venue:
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Year:
1979

Citing 8
Cited 1

A Combinatorial Problem Which Is Complete in Polynomial Space

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
A Time-Space Trade-Off

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A PSPACE Complete Problem Related to a Pebble Game

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Complexity of decision problems based on finite two-person perfect-information games

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An observation on time-storage trade off

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine a pebbling problem which has been used to study the storage requirements of various models of computation. Sethi has shown this problem to be NP-hard and Lingas has shown a generalization to be P-space complete. We prove the original problem P-space complete by employing a modification of Lingas's proof. The pebbling problem is one of the few examples of a P-space complete problem not exhibiting any obvious quantifier alternation.