Abstract
In the spirit of A. Cobham’s algebraic, machine-independent characterization of the collection FP of polynomial time computable functions in [Cob65] (see also [Ros84]), we characterize the collection AC O of functions computable with uniform constant depth polynomial size circuits and the collection NC of functions computable in polylogarithmic time with a polynomial number of processors on a parallel random access machine (PRAM). From these characterizations, we obtain level-by-level characterizations of the intermediate classes AC k and NC k. The class AC O is the closure of certain simple initial functions under composition and a variant of bounded primitive recursion called concatenation recursion on notation. The class NC is obtained from the same initial functions by adding a second variant of bounded primitive recursion called weak bounded recursion on notation. Thus, well known parallel complexity classes are characterized in a machine-independent manner using sequential operations. As a corollary, one can give Backus-Naur for a sequential programming language fragment of Pascal which “captures” the parallel complexity class NC, in the sense that functions, which can be programmed in this fragment, are exactly those which are computable in polylogarithmic time with a polynomial number of processors on a PRAM Note that this latter result is much more than a simple serialization of parallel code.
ArticleNote
Research partially supported by NSF grant# DCR-860615.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Buss, S. Cook, A. Gupta, V. Ramachandran, “An optimal parallel algorithm for formula evaluation”, preprint, 32 pages.
D. Mix Barrington, N. Immerman, H. Straubing, “On uniformity within NC1”, Structure in Complexity Theory: 3rd Annual Conference, IEEE Computer Society Press (1988), 47–59, to appear in J. Comp. Syst. Sci.
A. Borodin, “On relating time and space to size and depth”, SI AM J. Comput. 6 (1977), 733–744.
A. Cobham, “The intrinsic computational difficulty of functions”, in Logic, Methodology and Philosophy of Science II, Jerusalem 1964, ed. by Y. Bar-Hillel, North- Holland (1965), 24–30.
P. Clote, “A sequential characterization of the parallel complexity class NC” Technical Report BCCS-88-07, Boston College (1988) 31 pages.
P. Clote, “ALOGTIME and a conjecture of S.A. Cook”, to appear in Proceedings of Logic in Computer Science, Barcelona, June 1990.
P. Clote and S.A. Cook, “A recursion theoretic characterization of NC1”, unpublished working notes from July 1986.
K.J. Compton and C. Laflamme, “An algebra and a logic for NC1”, preprint, December 4, 1987, 8 pages.
S.A. Cook, “A taxonomy of problems with fast parallel algorithms”, Information and Control 64 (1985), 2–22.
S.A. Cook, A. Urquhart, “Functional interpretations of feasibly constructive arithmetic”, Technical Report 210/66, University of Toronto, June 1988, 70 pages. An extended abstract appeared in the Proc. 30th IEEE Symp. on Foundations of Computer Science (1989).
A. Chandra, L. Stockmeyer, U. Vishkin, Proc. 23rd IEEE Symp. on Foundations of Computer Science (1983) 1–13.
L. Goldschlager, “Synchronous parallel computation”, University of Toronto Tech. Report No. 114, December 1977, 131 pages.
N. Immerman, “Expressibility and parallel complexity”, Tech. Report, Yale University Department of Computer Science (1987), revised August 1988.
J.C. Lind, “Computing in logarithmic space”, Project Mac Technical Memorandum 52 (Sept 1974), Massachusetts Institute of Technology, 66 pages.
R. Lipton, “Model theoretic aspects of computational complexity”, Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science (1978), 193–200.
N. Pippenger, “On simultaneous resource bounds”, Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science (1979), 307–311.
H.E. Rose, Subrecursion — Functions and Hierarchies, Oxford Logic Guides: 9, Clarendon Press, Oxford (1984) 189 pages.
W. Ruzzo, “On uniform circuit complexity”, J. Comput. System Sci. 22 (1981), 365–383.
K. Wagner and G. Wechsung, Computational Complexity, D. Reidel Publishing Company, (1986) 551 pages.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Birkhäuser Boston
About this chapter
Cite this chapter
Clote, P.G. (1990). Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k, NC k and NC . In: Buss, S.R., Scott, P.J. (eds) Feasible Mathematics. Progress in Computer Science and Applied Logic, vol 9. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3466-1_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3466-1_4
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3483-4
Online ISBN: 978-1-4612-3466-1
eBook Packages: Springer Book Archive