A Combinatorial Problem Which Is Complete in Polynomial Space-Reference-Cited by-同舟云学术

A Combinatorial Problem Which Is Complete in Polynomial Space

Published:1976-10 Issue:4 Volume:23 Page:710-719
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Even S.¹,Tarjan R. E.²

Affiliation:

1. Department of Computer Science, Technion, Haifa, Israel

2. Department of Computer Science, Stanford University, Stanford, CA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321978.321989

Reference9 articles.

1. AHo A V HOPCROFr J E ANt) ULLMAN J D The Design and Analysis of Computer Algortthms Addison-Wesley Reading Mass 1974 AHo A V HOPCROFr J E ANt) ULLMAN J D The Design and Analysis of Computer Algortthms Addison-Wesley Reading Mass 1974

2. construcUve graph-theoretic soluuon of the Shannon switching game;RuNo J;IEEE Trans on Clrcutt Theory CT-17,1970

3. COOK S The complextty of theorem-proving procedures Proc Third Annual ACM Symp on Theory of Computing 1971 pp 151-158 10.1145/800157.805047 COOK S The complextty of theorem-proving procedures Proc Third Annual ACM Symp on Theory of Computing 1971 pp 151-158 10.1145/800157.805047

Cited by 92 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. “Intelligent Heuristics Are the Future of Computing”;ACM Transactions on Intelligent Systems and Technology;2023-11-14

2. Colored cut games;Theoretical Computer Science;2022-11

3. The Largest Connected Subgraph Game;Algorithmica;2022-05-07

4. Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. On Communication Complexity of Fixed Point Computation;ACM Transactions on Economics and Computation;2021-12-31