Publisher
Springer Nature Switzerland
Reference27 articles.
1. Allender, E., Ogihara, M.: Relationships among PL, #L, and the determinant. Informatique théorique et Applications 30, 1–21 (1996)
2. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoret. Comput. Sci. 107, 3–30 (1993)
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. Fenner, S., Fortnow, L., Kurtz, S.: Gap-definable counting classes. J. Comput. System Sci. 48, 116–148 (1994)
5. Lecture Notes in Computer Science;CA Kapoutsis,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献