Advertisement

A pspace complete problem related to a pebble game

  • Andrzej Lingas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)

Abstract

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.

Keywords

dag pebble game AND/OR graph computational complexity PSPACE completeness in polynomial space 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman /1974/, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading Mass.Google Scholar
  2. [2]
    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
  3. [3]
    S.Even and R.E.Tarjan, A.Combinatorial problem which is complete in polynomial space.Google Scholar
  4. [4]
    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
  5. [5]
    N.D. Jones, Y.E. Lien, W.T. Laaser /1976/, New problem complete for nondeterministic log-space, Mathematical Systems Theory 10:1, 239–259.CrossRefGoogle Scholar
  6. [6]
    W.J. Paul, R.E. Tarjan, J.R. Celoni /1976/77/, Space bounds for a game on graphs, Mathematical Systems Theory, 10:3, 1–17.CrossRefGoogle Scholar
  7. [7]
    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
  8. [8]
    W.J. Savitch /1970/, Relationships between nondeterministic and deterministic complexities, JCSS 4:2, 177–192.Google Scholar
  9. [9]
    R. Sethi /1975/, Complete register allocation problems, SIAM J.Computing 4:3, 226–248.CrossRefGoogle Scholar
  10. [10]
    R. Simon and R.C.T. Lee /1971/, On the optimal solution to AND/OR series-parallel praphs, J.ACM 18:3, 354–372.CrossRefGoogle Scholar
  11. [11]
    E. Stockmeyer /1977/, The polynomial-time hierarchy, Theoretical Computer Science, 3:1, 1–22.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Andrzej Lingas
    • 1
  1. 1.University of WarsawWarszawaPoland

Personalised recommendations