Pages that link to "Item:Q1313843"

The following pages link to The computational complexity of knot and matroid polynomials (Q1313843):

Displaying 13 items.

• Some unitary representations of Thompson's groups \(F\) and \(T\) (Q509938) (← links)
• Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
• The complexity of lattice knots (Q1295201) (← links)
• The complexities of the coefficients of the Tutte polynomial (Q1346689) (← links)
• The Tutte polynomial modulo a prime (Q1433006) (← links)
• An algorithm for the Tutte polynomials of graphs of bounded treewidth (Q1584397) (← links)
• Computer evaluation of Kauffman polynomials by using Gauss codes, with a skein-template algorithm (Q1855027) (← links)
• Complexity of Ising polynomials (Q2911072) (← links)
• Planarity of Knots, Register Automata and LogSpace Computability (Q3004597) (← links)
• (Q4252451) (← links)
• The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212) (← links)
• Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid (Q6181233) (← links)