A pspace complete problem related to a pebble game
The pebble game on AND/OR dags which is natural generalization of a well known pebble game on dags is considered. The following problem is given: if k pebbles are enough to place a pebble on a given vertex of an AND/OR dag. It is shown that the problem is log-space complete for languages accepted in polynomial space.
Keywordsdag pebble game AND/OR graph computational complexity PSPACE completeness in polynomial space
Unable to display preview. Download preview PDF.
- A.V. Aho, J.E. Hopcroft and J.D. Ullman /1974/, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading Mass.Google Scholar
- A.V.Aho and R.Sethi /1977/, How hard is compiler code generation? in: Proc. Fourth Colloquium on Automata Languages and Programming, pp. 1–15, Lecture Notes in Computer Science 52, Springer /1977/.Google Scholar
- S.Even and R.E.Tarjan, A.Combinatorial problem which is complete in polynomial space.Google Scholar
- J.E.Hopcroft, W.J.Paul and L.G.Valiant /1975/, On time versus space and related problems, Proc.16 th Annual Symposium on Fundations of Computer Science, pp.57–64.Google Scholar
- W.J.Paul, R.E.Tarjan /1977/, Time-space trade offs in a pebble game, in: Proc.Fourth Colloquium on Automata Languages and Programing, pp.365–369, Lecture Notes in Computer Science, Springer /1977/.Google Scholar
- W.J. Savitch /1970/, Relationships between nondeterministic and deterministic complexities, JCSS 4:2, 177–192.Google Scholar