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.
Statements (35)
| Predicate | Object |
|---|---|
| instanceOf |
academic book
ⓘ
conference proceedings ⓘ edited volume ⓘ |
| abbreviation | STOC 3 proceedings NERFINISHED ⓘ |
| academicDiscipline |
computer science
ⓘ
mathematics ⓘ |
| associatedWithOrganization | ACM Special Interest Group on Algorithms and Computation Theory NERFINISHED ⓘ |
| availability | ACM Digital Library NERFINISHED ⓘ |
| 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 NERFINISHED ⓘ |
| 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 NERFINISHED ⓘ |
| publisher | ACM NERFINISHED ⓘ |
| topic |
algorithms
ⓘ
automata theory ⓘ computability theory ⓘ computational complexity ⓘ formal languages ⓘ logic in computer science ⓘ |
| volumeOf | ACM Symposium on Theory of Computing proceedings series NERFINISHED ⓘ |
Referenced by (1)
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 surface form:
The Complexity of Theorem-Proving Procedures