Artificial Intelligence: A New Synthesis
Artificial Intelligence: A New Synthesis
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Theoretical Computer Science
On isomorphisms and density of NP and other complete sets
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Complexity of decision problems based on finite two-person perfect-information games
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We 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 any polynomial-space-bounded computation. This result suggests that the theory of combinatorial games is difficult.