Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. S.I. Adjan. Defining relations and algorithmic problems for groups and semigroups, volume 85 of Proceedings of the Steklov Institute of Mathematics. American Mathematical Society, 1967.
2. C. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Electronic Colloquium on Computational Complexity, Report No. TR96-039, 1996.
3. R. Armoni, A. Ta-Shma, A. Widgerson, and S. Zhou. An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. Journal of the Association for Computing Machinery, 47(2):294–311, 2000.
4. D. A. M. Barrington and J. Corbet. On the relative complexity of some languages in NC1. Information Processing Letters, 32:251–256, 1989.
5. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献