Cook, Stephen A. A taxonomy of problems with fast parallel algorithms. (English) Zbl 0575.68045 Inf. Control 64, 2-22 (1985). This is a revised and expanded version of the author’s paper in Lect. Notes Comput. Sci. 158, 78-93 (1983; Zbl 0529.68014). Cited in 1 ReviewCited in 167 Documents MSC: 68W99 Algorithms in computer science 68Q25 Analysis of algorithms and problem complexity 03D60 Computability and recursion theory on ordinals, admissible sets, etc. Keywords:uniform Boolean circuit families; reducibility; parallel greedy algorithm PDF BibTeX XML Cite \textit{S. A. Cook}, Inf. Control 64, 2--22 (1985; Zbl 0575.68045) Full Text: DOI