论文信息 - A PSPACE Complete Problem Related to a Pebble Game

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.

Andrzej Lingas

[1] Alfred V. Aho,et al. How Hard is Compiler Code Generation? , 1977, ICALP.

[2] Richard C. T. Lee,et al. On the Optimal Solutions to AND/OR Series-Parallel Graphs , 1971, JACM.

[3] Robert E. Tarjan,et al. Time-Space Trade-Offs in a Pebble Game , 1977, ICALP.

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[5] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[6] Ravi Sethi. Complete Register Allocation Problems , 1975, SIAM J. Comput..

[7] Leslie G. Valiant,et al. On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.

[9] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[10] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.