Author:
Damm Carsten,Holzer Markus,Lange Klaus-Jörn
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC 1. Journal of Computer and System Sciences, 41:274–306, 1990.
2. R. V. Book. Sparse sets, tally sets, and polynomial reducibilities. In Proc.of 13th MFCS, volume 324 of LNCS, pages 1–13. Springer, 1988.
3. S. R. Buss. The boolean formula value problem is in ALOGTIME. In Proc. 19th Ann. ACM Symp. on Theory of Computing, pages 123–131, 1987.
4. A. K. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13(2):423–439, May 1984.
5. S. A. Cook. Towards a complexity theory of synchronous parallel computation. L'Enseignement Mathématique, XXVII(1–2):75–100, 1981.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献