Proceedings of the Third Annual ACM Symposium on Theory of Computing
E1045587
Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Proceedings of the Third Annual ACM Symposium on Theory of Computing canonical | 2 |
| STOC 3 proceedings | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13507010 — 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 Third Annual ACM Symposium on Theory of Computing Context triple: [The Complexity of Theorem-Proving Procedures, publishedIn, Proceedings of the Third Annual ACM Symposium on Theory of Computing]
-
A.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
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.
-
B.
ACM Symposium on Theory of Computing
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
-
C.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
D.
SIAM Journal on Computing
SIAM Journal on Computing is a leading peer-reviewed scientific journal that publishes research in theoretical computer science, including algorithms, complexity theory, and related areas of computation.
-
E.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
- 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 Third Annual ACM Symposium on Theory of Computing Target entity description: Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
-
A.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
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.
-
B.
ACM Symposium on Theory of Computing
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
-
C.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
D.
SIAM Journal on Computing
SIAM Journal on Computing is a leading peer-reviewed scientific journal that publishes research in theoretical computer science, including algorithms, complexity theory, and related areas of computation.
-
E.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
- F. None of above. chosen
Statements (35)
| Predicate | Object |
|---|---|
| instanceOf |
academic book
ⓘ
conference proceedings ⓘ edited volume ⓘ |
| abbreviation | STOC 3 proceedings ⓘ |
| academicDiscipline |
computer science
ⓘ
mathematics ⓘ |
| associatedWithOrganization |
ACM Special Interest Group on Algorithms and Computation Theory
ⓘ
linked to:
SIGACT
|
| availability | ACM Digital Library ⓘ |
| contains |
early foundational work in computational complexity
ⓘ
early foundational work in the theory of computation ⓘ |
| describedAs | conference volume collecting influential early research papers in theoretical computer science ⓘ |
| documentType | peer-reviewed conference proceedings ⓘ |
| eventSeries | ACM Symposium on Theory of Computing ⓘ |
| field |
computational complexity theory
ⓘ
foundations of computation ⓘ theoretical computer science ⓘ |
| genre |
conference proceedings volume
ⓘ
scientific literature ⓘ |
| hasPart |
conference contributions
ⓘ
research papers ⓘ |
| intendedAudience |
graduate students in computer science
ⓘ
researchers in theoretical computer science ⓘ |
| language | English ⓘ |
| medium |
digital
ⓘ
print ⓘ |
| ordinalInSeries | 3 ⓘ |
| publishedBy | Association for Computing Machinery ⓘ |
| publisher | ACM ⓘ |
| topic |
algorithms
ⓘ
automata theory ⓘ computability theory ⓘ computational complexity ⓘ formal languages ⓘ logic in computer science ⓘ |
| volumeOf |
ACM Symposium on Theory of Computing proceedings series
ⓘ
linked to:
ACM Symposium on Theory of Computing
|
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Proceedings of the Third Annual ACM Symposium on Theory of Computing Description of subject: Proceedings of the Third Annual ACM Symposium on Theory of Computing is a conference volume collecting influential early research papers in theoretical computer science, particularly in computational complexity and the foundations of computation.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
The Complexity of Theorem-Proving Procedures
→
publishedIn
→
Proceedings of the Third Annual ACM Symposium on Theory of Computing
ⓘ
subject linked to:
"The Complexity of Theorem-Proving Procedures"
Cook–Levin theorem
→
publishedIn
→
Proceedings of the Third Annual ACM Symposium on Theory of Computing
ⓘ
Proceedings of the Third Annual ACM Symposium on Theory of Computing
→
abbreviation
→
STOC 3 proceedings
ⓘ
linked to: Proceedings of the Third Annual ACM Symposium on Theory of Computing