Publisher
Springer International Publishing
Reference12 articles.
1. Allender, E., Chen, S., Lou, T., Papakonstantinou, P.A., Tang, B.: Width-parameterized SAT: time-space tradeoffs. Theory Comput. 10, 297–339 (2014)
2. Barnes, G., Buss, J.F., Ruzzo, W.L., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. SIAM J. Comput. 27, 1273–1282 (1998)
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. Lecture Notes in Computer Science;D Chakraborty,2015
5. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic automata into simpler automata. Theoret. Comput. Sci. 295, 189–203 (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献