Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Allender, E., Mix Barrington, D., Chakraborty, T., Datta, S., Roy, S.: Grid graph reachability problems. In: IEEE Conference on Computational Complexity, pp. 299–313. IEEE Computer Society Press, Los Alamitos (2006)
2. Lecture Notes in Computer Science;E. Allender,2005
3. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107, 3–30 (1993)
4. Allender, E., Lange, K.-J.: RUSPACE(logn) is contained in DSPACE(log2
n / loglogn). Theory of Computing Systems 31, 539–550 (1998)
5. Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences 59(2), 164–181 (1999)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献