A taxonomy of problems with fast parallel algorithms

1985/01/01 by Stephen Cook, Stephen A. Cook · 6 citations
Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #VLSI and FPGA Design Techniques

paper · doi:10.1016/s0019-9958(85)80041-3

crossref issued 1985/01/01 · crossref published 1985/01/01 · crossref published-print 1985/01/01 · openalex publication_date 1985/01/01 · crossref created 2005/05/06 · crossref deposited 2019/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/18 · crossref indexed 2026/06/19

Citations

• Computational Complexity of Probabilistic Turing Machines

Cited by

• Improved Bounds on the Space Complexity of Circuit Evaluation
• Logspace Versions of the Theorems of Bodlaender and Courcelle
• Reversible Space Equals Deterministic Space
• Clique problem [wikipedia]
• NC (complexity) [wikipedia]
• Topological sorting [wikipedia]