Funder
Alexander von Humboldt-Stiftung
DFG
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. The isomorphism problem for k-trees is complete for logspace;Arvind;Inform. and Comput.,2012
2. The formula isomorphism problem;Agrawal;SIAM J. Comput.,2000
3. Isomorhism of hypergraphs of low rank in moderately exponential time;Babai,2008
4. Complexity measures and decision tree complexity: a survey;Buhrman;Theoret. Comput. Sci.,2002
5. On truth-table reducibility to SAT;Buss;Inform. and Comput.,1991
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献