Pages that link to "Item:Q4712248"
From MaRDI portal
The following pages link to On the computational complexity of the Jones and Tutte polynomials (Q4712248):
Displaying 50 items.
- The Tutte polynomial modulo a prime (Q1433006) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Bicycle dimension and special points of the Tutte polynomial (Q1569033) (← links)
- An algorithm for the Tutte polynomials of graphs of bounded treewidth (Q1584397) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Transfer-matrix methods meet Ehrhart theory (Q1644957) (← links)
- Relaxations of \(\mathrm{GF}(4)\)-representable matroids (Q1648663) (← links)
- Models of random knots (Q1659256) (← links)
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Singularities in Negami's splitting formula for the Tutte polynomial (Q1701095) (← links)
- On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model (Q1706299) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
- Series-parallel posets and the Tutte polynomial (Q1815311) (← links)
- The complexity of computing the Tutte polynomial on transversal matroids (Q1842565) (← links)
- Energy, ropelength, and other physical aspects of equilateral knots. (Q1873403) (← links)
- On the number of Eulerian orientations of a graph (Q1923856) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- The Tutte polynomial of some matroids (Q1953655) (← links)
- A categorification of the Jones polynomial (Q1975991) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- Braiding, Majorana fermions, Fibonacci particles and topological quantum computing (Q1993849) (← links)
- Interpretations of the Tutte and characteristic polynomials of matroids (Q2025137) (← links)
- On the HOMFLY polynomials of even trigonal bipyramid links (Q2118794) (← 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)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Tutte polynomials of Fan-like graphs with applications in benzenoid systems (Q2245970) (← links)
- Thomas H. Brylawski (1944--2007) (Q2275462) (← links)
- A Tutte-style proof of Brylawski's tensor product formula (Q2275468) (← links)
- Tutte polynomials of alternating polycyclic chains (Q2278819) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Interpretations of the Tutte polynomials of regular matroids (Q2334522) (← links)
- Anyonic quantum walks (Q2379287) (← links)
- Edge cut splitting formulas for Tutte-Grothendieck invariants (Q2396895) (← links)
- The drop polynomial of a weighted digraph (Q2399350) (← links)
- On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid (Q2441567) (← links)
- Knot invariants and the Bollobás-Riordan polynomial of embedded graphs (Q2462321) (← links)
- The Tutte polynomial of a morphism of matroids. IV: Computational complexity (Q2474788) (← links)
- Computing spin networks (Q2484201) (← links)
- On the colored Tutte polynomial of a graph of bounded treewidth (Q2492206) (← links)
- The HOMFLY polynomials of odd polyhedral links (Q2517599) (← links)
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (Q2563513) (← links)
- The complexity of partition functions (Q2581263) (← links)
- Upper bound for the number of spanning forests of regular graphs (Q2700981) (← links)
- The Potts model and the Tutte polynomial (Q2737867) (← links)
- Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Q2819199) (← links)
- POST QUANTUM CRYPTOGRAPHY FROM MUTANT PRIME KNOTS (Q2893169) (← links)
