An overview of computational complexity
From MaRDI portal
Publication:3759938
DOI10.1145/358141.358144zbMath0622.68039WikidataQ55890216 ScholiaQ55890216MaRDI QIDQ3759938
Publication date: 1983
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358141.358144
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68-03: History of computer science
Related Items
COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS, A parallel algorithm for the monadic unification problem, Constructing a perfect matching is in random NC, Tradeoffs for language recognition on alternating machines, Classifying the computational complexity of problems, Parallel computation of manipulator inverse dynamics