Author:
Bläser Markus,Curticapean Radu
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;I. Averbouch,2008
2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: FOCS 2008, pp. 677–686 (2008)
3. Bläser, M., Dell, H.: Complexity of the cover polynomial. In: ICALP, pp. 801–812 (2007)
4. Bläser, M., Dell, H., Fouz, M.: Complexity and approximability of the cover polynomial. Computation Complexity (accepted)
5. Lecture Notes in Computer Science;M. Bläser,2008
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A full complexity dichotomy for immanant families;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
2. Block interpolation: A framework for tight exponential-time counting complexity;Information and Computation;2018-08
3. The matrix cover polynomial;Journal of Combinatorics;2016
4. Weighted Counting of k-Matchings Is #W[1]-Hard;Parameterized and Exact Computation;2012