Publisher
Springer International Publishing
Reference20 articles.
1. Lecture Notes in Computer Science;EW Allender,1986
2. Allender, E., Rubinstein, R.: P-printable sets. SIAM J. Comput. 17, 1193–1202 (1988)
3. Berman P., Lingas, A.: On complexity of regular languages in terms of finite automata, Report 304, Institute of Computer Science, Polish Academy of Science, Warsaw (1977)
4. Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1, 1–17 (2009)
5. Buntrock, G., Jenner, B., Lange, K., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: the Proceedings of FCT1991, LNCS vol. 529, pp. 168–179 (1991)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献