Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Width-parameterized SAT: time-space tradeoffs;Allender;Theory Comput.,2014
2. A sublinear space, polynomial time algorithm for directed s-t connectivity;Barnes;SIAM J. Comput.,1998
3. On Complexity of Regular Languages in Terms of Finite Automata;Berman,1977
4. Alternation;Chandra;J. ACM,1981
5. Simultaneous time-space upper bounds for red-blue path problem in planar DAGs;Chakraborty,2015
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献