Cited By
View all- De Millo RMiller R(1979)Implicit computation of synchronization primitivesInformation Processing Letters10.1016/0020-0190(79)90105-49:1(35-38)Online publication date: Jul-1979
Classes of pebble games and complete problems
Authors: 
T. Kasai, A. Adachi, S. IwataAuthors Info & Claims
T. Kasai, A. Adachi, S. IwataAuthors Info & ClaimsPages 914 - 918
Abstract
A “pebble game” is introduced and some restricted pebble games are considered. It is shown that in each of these games the problem to determine whether there is a winning strategy (two-person game) is harder than the solvability problem (one-person game). We also show that each of these problems is complete in well known complexity classes.
References
[1]
Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithms, (Addison-Wesley, Reading, Mass., 1974).
[2]
Chandra, A. K. and Stockmeyer, L. J., Alternation, Proc. 17th Ann. IEEE Symp. On Foundation of Computer Sciences, 98 (1976).
[3]
Cook, S. A., The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, 151,(1971).
[4]
Cook, S. A., An observation on time-storage tradeoff, J. Comput. Syst. Sci., 9, 213 (1974).
[5]
Cook, S. A. and Sethi R., Storage requirements for deterministic polynomial time recognizable languages, J. Comput, Syst, Sci., 13, 25 (1976).
[6]
Even, S. and Tarjan, R. E., A combinatorial which is complete in polynomial space, J. ACM, 23, 710 (1976).
[7]
Hopcroft, J.E. and Ullman, J. D., Formal Languages and Their Relation to Automata, (Addison-Wesley, Readind, Mass., 1969).
[8]
Jones, N. D. and Laaser, W. T., Complete problems for deterministic polynomial time, Theoretical Comp. Sci., 3, 105 (1977).
[9]
Karp, R. M., Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., p. 85 (Plenum Press, New York, 1972).
[10]
Schaefer, T. J., Complexity of decision problems based on finite two-person perfect-information games, Proc. 8th Ann. ACM Symp. on Theory of Computing, 41 (1976).
Index Terms
- Classes of pebble games and complete problems
Recommendations
Classes of Pebble Games and Complete Problems
A “pebble game” is introduced and some restricted pebble games are considered. It is shown that in each of these games the problem to determine whether there is a winning strategy (two-person game) is harder than the solvability problem (one-person game). ...
Edge-removing games on graphs
AbstractThis paper studies three edge-removing games on graphs. In each game, there are two players and a simple graph G at the beginning. The players take turns removing at least one edge of a certain type from the current graph. The one who cannot move ...
Comments
Information & Contributors
Information
Published In
January 1978
990 pages
Copyright © 1978 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1978
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 520Total Downloads
- Downloads (Last 12 months)72
- Downloads (Last 6 weeks)10
Reflects downloads up to 10 Oct 2024
Other Metrics
Citations
Cited By
View all- De Millo RMiller R(1979)Implicit computation of synchronization primitivesInformation Processing Letters10.1016/0020-0190(79)90105-49:1(35-38)Online publication date: Jul-1979
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in