Cook, Stephen A. The classification of problems which have fast parallel algorithms. (English) Zbl 0529.68014 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/Swed. 1983, Lect. Notes Comput. Sci. 158, 78-93 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 7 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:fast parallel algorithms; uniform Boolean circuit families; reducibility; parallel greedy algorithm Citations:Zbl 0513.00010 PDF BibTeX XML OpenURL