Pages that link to "Item:Q1926110"

The following pages link to Inapproximability of the Tutte polynomial of a planar graph (Q1926110):

Displaying 13 items.

• Complexity and approximability of the cover polynomial (Q445242) (← links)
• Inapproximability of the Tutte polynomial (Q937302) (← links)
• The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044) (← links)
• Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials (Q1936248) (← links)
• The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
• Functional clones and expressibility of partition functions (Q2357376) (← links)
• Density of Real Zeros of the Tutte Polynomial (Q4635510) (← links)
• The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
• A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs (Q5300994) (← links)
• Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← 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)