Skip to main content
Conference Proceedings

A pspace complete problem related to a pebble game

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1978) 62 LNCS 300-321
DOI: 10.1007/3-540-08860-1_22
17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Lingas, A. (1978). A pspace complete problem related to a pebble game. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 62 LNCS, pp. 300–321). Springer Verlag. https://doi.org/10.1007/3-540-08860-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free