Author:
Köbler Johannes,Kuhnert Sebastian
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;V. Arvind,2007
2. Lecture Notes in Computer Science;V. Arvind,2008
3. Aho, A., Hopcroft, J., Ullman, J.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)
4. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107(1), 3–30 (1993)
5. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. Information and Computation 204(5), 835–852 (2006)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献