The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid

Andreas Björklund, Petteri Kaski. The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 2333-2345, SIAM, 2021. [doi]

Abstract

Abstract is missing.