Author:
Bläser Markus,Dell Holger,Fouz Mahmoud
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference31 articles.
1. Artur Andrzejak (1998) An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Mathematics 190(1–3): 39–54
2. Ilia Averbouch , Benny Godlin & Johann A. Makowsky (2008). A Most General Edge Elimination Polynomial. In Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 – July 2, 2008. Revised Papers, volume 5344 of Lecture Notes in Computer Science, 31–42.
3. Andreas Björklund, Thore Husfeldt, Petteri Kaski & Mikko Koivisto (2008). Computing the Tutte polynomial in vertex-exponential time.
4. Markus Bläser, Holger Dell & Johann A. Makowsky (2008). Complexity of the Bollobás-Riordan Polynomial. In 3rd International Computer Science Symposium in Russia (CSR), 86–98.
5. Markus Bläser & Christian Hoffmann (2008). On the Complexity of the Interlace Polynomial. In 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Susanne Albers & Pascal Weil, editors, 97–108. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, Dagstuhl, Germany. http://drops.dagstuhl.de/opus/volltexte/2008/1337
Cited by
3 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. The matrix cover polynomial;Journal of Combinatorics;2016
3. Noncommutativity makes determinants hard;Information and Computation;2015-08