Author:
Arvind V.,Das Bireswar,Köbler Johannes,Kuhnert Sebastian
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference36 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. The complexity of planarity testing;Allender;Inform. and Comput.,2004
3. A very hard log-space counting class;Àlvarez;Theoret. Comput. Sci.,1993
4. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1998
5. The space complexity of k-tree isomorphism;Arvind,2007
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献