S. Even
R. E. Tarjan
Abstract
This paper considers a generalization, called the Shannon switching game on vertices, of a familiar board game called Hex. It is shown that determining who wins such a game if each player plays perfectly is very hard; in fact, if this game problem is solvable in polynomial time, then any problem solvable in polynomial space is solvable in polynomial time. This result suggests that the theory of combinational games is difficult.
- 1 AHo, A V , HOPCROFr, J E , ANt) ULLMAN, J D The Design and Analysis of Computer Algortthms Addison-Wesley, Reading, Mass , 1974 Google Scholar
- 2 BRuNo, J, AND WEINaERO, L A construcUve graph-theoretic soluuon of the Shannon switching game IEEE Trans on Clrcutt Theory CT-17, 1 (Feb. 1970), 74-81Google Scholar
- 3 CHASE, S An implemented graph algon~m for winning Shannon switching games. Tech. Rep RC-3121, IBM Thomas T Watson Research Center, Yorktown Heights, N Y, 1970Google Scholar
- 4 COOK, S The complextty of theorem-proving procedures Proc Third Annual ACM Symp on Theory of Computing, 1971, pp 151-158 Google Scholar
- 5 KARP, R Reduclblhty among combinatorial problems In Complextty of Computer Computanons, R E Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-104.Google Scholar
- 6 MEYER, A,R, At~t) STOCKM~VV-R, L.J Word problems requinng exponenual ume. Proc. Fifth Annual ACM Symp on Theory of Computing, 1973, pp. 1-9 Google Scholar
- 7 NILSSON, N Problem-Solvmg Methods In Arttfictal lntelhgence McGraw-Hall, New York, 1971 Google Scholar
- 8 SChAeFER, T i Complexity of deoslon problems based on flmte two-person perfect-mformauon games Proc 8th Ann ACM Symp on Theory of Computing, 1976, pp 41-49 Google Scholar
- 9 TA~AN, R Depth-first search and hnear graph algorithms. SlAM J Computing 1,2 (1972), 146-160Google Scholar
- 10 TARJAN, R Unpublished notes (1974)Google Scholar
Index Terms
- A Combinatorial Problem Which Is Complete in Polynomial Space
Recommendations
A combinatorial problem which is complete in polynomial space
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingWe consider a generalization, which we call the Shannon switching game on vertices, of a familiar board game called HEX. We show that determining who wins such a game if each player plays perfectly is very hard; in fact, it is as hard as carrying out ...
Autoreducibility of complete sets for log-space and polynomial-time reductions
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part IWe investigate the autoreducibility and mitoticity of complete sets for several classes with respect to different polynomial-time and logarithmic-space reducibility notions.
Previous work in this area focused on polynomial-time reducibility notions. ...
The (k,ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy
A graph G = ( V , E ) is C probe if V can be partitioned into two sets, probes P and non-probes N, where N is independent and new edges may be added between non-probes such that the resulting graph is in the graph class C . We say that ( N , P ) is a C ...
Comments