Skip to main content
SpringerLink
Log in

A pspace complete problem related to a pebble game

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 62))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. S.Even and R.E.Tarjan, A.Combinatorial problem which is complete in polynomial space.

    Google Scholar 

  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. N.D. Jones, Y.E. Lien, W.T. Laaser /1976/, New problem complete for nondeterministic log-space, Mathematical Systems Theory 10:1, 239–259.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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. W.J. Savitch /1970/, Relationships between nondeterministic and deterministic complexities, JCSS 4:2, 177–192.

    Google Scholar 

  9. R. Sethi /1975/, Complete register allocation problems, SIAM J.Computing 4:3, 226–248.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  11. E. Stockmeyer /1977/, The polynomial-time hierarchy, Theoretical Computer Science, 3:1, 1–22.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warsaw, Nowogrodzka 76 m.11, 02-018, Warszawa, Poland

    Andrzej Lingas

Authors
  1. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lingas, A. (1978). A pspace complete problem related to a pebble game. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation