[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/800116.803754acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

A combinatorial problem which is complete in polynomial space

Published: 05 May 1975 Publication History

Abstract

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.

References

[1]
S. Chase, "An implemented graph algorithm for winning Shannon switching games," IBM Research Technical Report RC-3121, Yorktown Heights, New York (1970).
[2]
S. Cook, "The complexity of theorem-proving procedures," Proceedings Third Annual ACM Symposium on Theory of Computing (1971), 151-158.
[3]
R. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., Plenum Press, New York (1972), 85-104.
[4]
A.R. Meyer and L.J. Stockmeyer, "Words problems requiring exponential time," Proceedings Fifth Annual ACM Symposium on Theory of Computing (1973), 1-9.
[5]
N. Nilsson, Problem-Solving Methods in Artificial Intelligence, McGraw-Hill, New York (1971).
[6]
R. Tarjan, unpublished notes (1974).
[7]
R. Tarjan, "Depth-first search and linear graph algorithms," SIAM J. Comput., Vol. 1, No. 2 (1972), 146-160.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computing
May 1975
265 pages
ISBN:9781450374194
DOI:10.1145/800116
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 1975

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Completeness in polynomial space
  2. Computational complexity
  3. HEX
  4. Shannon switching game

Qualifiers

  • Article

Acceptance Rates

STOC '75 Paper Acceptance Rate 31 of 87 submissions, 36%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)2
Reflects downloads up to 21 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media