Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
From MaRDI portal
Publication:1936248
DOI10.1016/j.jcss.2012.04.005zbMath1258.05020arXiv1006.5234MaRDI QIDQ1936248
Leslie Ann Goldberg, Mark R. Jerrum
Publication date: 21 February 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.5234
cycle index polynomial; Tutte polynomial of a binary matroid; weight enumerator of a binary linear code
05C31: Graph polynomials
05B35: Combinatorial aspects of matroids and geometric lattices
68W20: Randomized algorithms
Related Items
Unnamed Item, A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid, Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin, The Complexity of Approximately Counting Tree Homomorphisms