论文信息 - The complexity of short two-person games

The complexity of short two-person games

Abstract Cook posed the question of finding a natural problem that is complete for AC1. It is shown here that a certain two-person game of perfect information is such a problem. Variants of this game are shown to be complete for P and for LOGCFL.

Martin Tompa | Ashok K. Chandra

[1] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[2] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[3] Martin Tompa,et al. A new pebble game that characterizes parallel complexity classes , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[5] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[8] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[9] Thomas J. Schaefer,et al. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[10] H. Venkateswaran,et al. Properties that characterize LOGCFL , 1987, J. Comput. Syst. Sci..

[11] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[12] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[13] Patrick W. Dymond,et al. Speedups of Deterministic Machines by Synchronous Parallel Machines , 1985, J. Comput. Syst. Sci..