Pages that link to "Item:Q937302"

The following pages link to Inapproximability of the Tutte polynomial (Q937302):

Displaying 29 items.

• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
• Sparse reliable graph backbones (Q418121) (← links)
• Complexity and approximability of the cover polynomial (Q445242) (← links)
• Expansions for the Bollobás-Riordan polynomial of separable ribbon graphs (Q659659) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
• Random cluster dynamics for the Ising model is rapidly mixing (Q1650104) (← links)
• The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
• The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
• Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
• Holomorphic quadratic differentials on graphs and the chromatic polynomial (Q2010640) (← links)
• Interpretations of the Tutte and characteristic polynomials of matroids (Q2025137) (← links)
• The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Interpretations of the Tutte polynomials of regular matroids (Q2334522) (← links)
• Edge cut splitting formulas for Tutte-Grothendieck invariants (Q2396895) (← links)
• Triangulations of Cayley and Tutte polytopes (Q2437468) (← links)
• Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
• Some Inequalities for Whitney–Tutte Polynomials (Q3058298) (← links)
• The Exponential Time Complexity of Computing the Probability That a Graph Is Connected (Q3058703) (← links)
• Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• (Q5002746) (← links)
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
• The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
• Modifications of Tutte–Grothendieck invariants and Tutte polynomials (Q5154563) (← links)
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
• Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
• Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid (Q6181233) (← links)