Author:
Allender Eric,Mahajan Meena
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 218–223. IEEE, 1979.
2. C. Àlvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Technical Report ECCC-TR96-039, Electronic Colloquium on Computational Complexity, 1996.
3. R. Armoni, A. Ta-Shma, A. Wigderson, and S. Zhou.
$$
SL \subseteq L^{\tfrac{4}
{3}}
$$
. In Proceedings of the 29th Annual Symposium on Theory of Computing, pages 230–239. ACM, 1997.
4. K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.
5. A. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13(2):423–439, 1984.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献