Author:
Hofmann Martin,Ramyaa Ramyaa,Schöpp Ulrich
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;G. Bonfante,2006
2. Cai, J.-Y., Sivakumar, D.: Sparse hard sets for P: Resolution of a conjecture of Hartmanis. J. Comput. Syst. Sci. 58(2), 280–296 (1999)
3. Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput. 9(3), 636–652 (1980)
4. Ebbinghaus, H.-D., Flum, J.: Finite model theory. Springer (1995)
5. Etessami, K., Immerman, N.: Tree canonization and transitive closure. In: IEEE Symp. Logic in Comput. Sci., pp. 331–341 (1995)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterizingco-NLby a group action;Mathematical Structures in Computer Science;2014-12-05