Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing

E74102

academic book conference proceedings edited volume

Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (4)

Label	Occurrences
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing canonical	2
Proceedings of the ACM Symposium on Theory of Computing	1
STOC 1985 Proceedings	1
Seventeenth Annual ACM Symposium on Theory of Computing	1

How this entity was disambiguated

This entity first appeared as the object of triple T591830 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Context triple: [The Knowledge Complexity of Interactive Proof Systems, publishedIn, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing]

A. PODS Conference (jointly with ACM SIGACT)
The PODS Conference (jointly with ACM SIGACT) is a premier international research conference focused on the theoretical foundations of data management and database systems.
B. Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
C. Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
D. Communications of the ACM
Communications of the ACM is a leading peer-reviewed magazine that publishes articles and research on computer science and information technology for the global computing community.
E. International Conference on Distributed Computing Systems
The International Conference on Distributed Computing Systems is a leading annual research conference focused on the theory, design, implementation, and applications of distributed computing and distributed systems.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Target entity description: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.

A. PODS Conference (jointly with ACM SIGACT)
The PODS Conference (jointly with ACM SIGACT) is a premier international research conference focused on the theoretical foundations of data management and database systems.
B. Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
C. Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
D. Communications of the ACM
Communications of the ACM is a leading peer-reviewed magazine that publishes articles and research on computer science and information technology for the global computing community.
E. International Conference on Distributed Computing Systems
The International Conference on Distributed Computing Systems is a leading annual research conference focused on the theory, design, implementation, and applications of distributed computing and distributed systems.
F. None of above. chosen

Statements (44)

Predicate	Object
instanceOf	academic book ⓘ conference proceedings ⓘ edited volume ⓘ
abbreviation	Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-linksurface differs ⓘ surface form: STOC 1985 Proceedings
academicDiscipline	theoretical computer science ⓘ
associatedWith	ACM Special Interest Group ⓘ surface form: ACM Special Interest Group on Algorithms and Computation Theory SIGACT ⓘ
basedOnEvent	Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-linksurface differs ⓘ surface form: Seventeenth Annual ACM Symposium on Theory of Computing
category	conference proceedings in computer science ⓘ
citationType	primary research literature ⓘ
contains	conference papers ⓘ influential research papers ⓘ research papers ⓘ
countryOfPublication	United States of America ⓘ surface form: United States
documentType	peer-reviewed conference proceedings ⓘ
eventSeries	ACM Symposium on Theory of Computing ⓘ
field	computer science ⓘ theoretical computer science ⓘ
focus	foundational results in theoretical computer science ⓘ
hasEditionNumber	17 ⓘ
intendedAudience	graduate students in computer science ⓘ researchers in theoretical computer science ⓘ
isAbout	computational complexity classes ⓘ formal models of computation ⓘ proof systems in computation ⓘ theory of computation ⓘ
isPartOfSeries	ACM Symposium on Theory of Computing ⓘ surface form: STOC conference proceedings
language	English ⓘ
medium	digital ⓘ print ⓘ
organization	Association for Computing Machinery ⓘ
publicationYear	1985 ⓘ
publisher	ACM ⓘ Association for Computing Machinery ⓘ
seriesOrdinal	17 ⓘ
timePeriod	1980s theoretical computer science research ⓘ
title	Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-link ⓘ
topic	algorithms ⓘ complexity theory ⓘ computational complexity ⓘ computational lower bounds ⓘ computational models ⓘ interactive proof systems ⓘ randomized computation ⓘ

How these facts were elicited

Referenced by (5)

Full triples — surface form annotated when it differs from this entity's canonical label.

The Knowledge Complexity of Interactive Proof Systems → publishedIn → Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing ⓘ

Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing → title → Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-link ⓘ

Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing → basedOnEvent → Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-linksurface differs ⓘ

this entity surface form: Seventeenth Annual ACM Symposium on Theory of Computing

Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing → abbreviation → Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing self-linksurface differs ⓘ

this entity surface form: STOC 1985 Proceedings

ACM Symposium on Theory of Computing → hasProceedingsSeries → Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing ⓘ

this entity surface form: Proceedings of the ACM Symposium on Theory of Computing

All labels observed (4)

How this entity was disambiguated Show

Statements (44)

How these facts were elicited Show

Referenced by (5)

How this entity was disambiguated

How these facts were elicited