Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC-Reference-Cited by-同舟云学术

Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC

Published:1990 Issue: Volume: Page:49-69
ISSN:
Container-title:Feasible Mathematics
language:
Short-container-title:

Author:

Clote Peter G.

Publisher

Birkhäuser Boston

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-3466-1_4.pdf

Reference19 articles.

1. S. Buss, S. Cook, A. Gupta, V. Ramachandran, “An optimal parallel algorithm for formula evaluation”, preprint, 32 pages.

2. 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.

3. A. Borodin, “On relating time and space to size and depth”, SI AM J. Comput. 6 (1977), 733–744.

4. 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.

5. P. Clote, “A sequential characterization of the parallel complexity class NC” Technical Report BCCS-88-07, Boston College (1988) 31 pages.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generation of small complexity classes using logical formulas, schemes and operations of bounded concatenation;Mathematical Problems of Cybernetics;2023

2. On the Coincidence of Complexity Classes BPC and TC$${}^{0}$$;Moscow University Computational Mathematics and Cybernetics;2022-12

3. New substitution bases for complexity classes;Mathematical Logic Quarterly;2019-12-23

4. Pointers in Recursion: Exploring the Tropics;Electronic Proceedings in Theoretical Computer Science;2019-08-14

5. Bounded monotone recursion and multihead automata;Programming and Computer Software;2013-11