Pages that link to "Item:Q1936248"

The following pages link to Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials (Q1936248):

Displaying 12 items.

• Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach (Q394809) (← links)
• Inapproximability of the Tutte polynomial (Q937302) (← links)
• A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures (Q1745137) (← links)
• Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
• On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid (Q2441567) (← links)
• The Tutte polynomial of a morphism of matroids. IV: Computational complexity (Q2474788) (← links)
• The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
• (Q3447284) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• The Tutte Polynomial for Matroids of Bounded Branch-Width (Q5479033) (← links)
• A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid (Q5891167) (← links)
• Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid (Q6181233) (← links)