Funder
DFG
Indo-German Max-Planck Center for Computer Science
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference20 articles.
1. On the hardness of the noncommutative determinant;Arvind,2010
2. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor;Barvinok;Random Struct. Algorithms,1999
3. Complexity of the cover polynomial;Bläser,2007
4. Complexity and approximability of the cover polynomial;Bläser;Comput. Complex.,2012
5. Almost settling the hardness of noncommutative determinant;Chien,2011
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献