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.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Computing the Tutte polynomial of Archimedean tilings (Q279654) (← links)
- Low depth quantum circuits for Ising models (Q339445) (← links)
- An atlas of limit set dynamics for asynchronous elementary cellular automata (Q393149) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
- Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
- A celtic framework for knots and links (Q542383) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- The architecture and the Jones polynomial of polyhedral links (Q652714) (← links)
- Expansions for the Bollobás-Riordan polynomial of separable ribbon graphs (Q659659) (← links)
- Interval partitions and activities for the greedoid Tutte polynomial (Q679037) (← links)
- Plane graphs and link invariants (Q685681) (← links)
- Tutte polynomials computable in polynomial time (Q686299) (← links)
- On the topology of graph picture spaces (Q702703) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- The Tutte-Potts connection in the presence of an external magnetic field (Q719787) (← links)
- Complexity classes as mathematical axioms (Q731212) (← links)
- Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
- The Tutte polynomials of catacondensed benzenoid systems (Q830853) (← links)
- Jones polynomial of knots formed by repeated tangle replacement operations (Q837637) (← links)
- On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid (Q857752) (← links)
- Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation (Q885684) (← links)
- Tutte polynomial of pseudofractal scale-free web (Q888270) (← links)
- Failed disk recovery in double erasure RAID arrays (Q924549) (← links)
- On the exact evaluation of certain instances of the Potts partition function by quantum computers (Q926258) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- Chip firing and all-terminal network reliability bounds (Q1040088) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- Monomial bases for broken circuit complexes (Q1041597) (← links)
- Invariants of composite networks arising as a tensor product (Q1043823) (← links)
- A new invariant of plane bipartite cubic graphs (Q1197024) (← links)
- A new algorithm for recognizing the unknot (Q1279535) (← links)
- The polytope of win vectors (Q1293440) (← links)
- Combinatorics and topology - François Jaeger's work in knot theory (Q1296152) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- The random cluster process (Q1344626) (← links)
- The complexities of the coefficients of the Tutte polynomial (Q1346689) (← links)
- Splitting formulas for Tutte polynomials (Q1362104) (← links)
- The Go polynomials of a graph. (Q1426435) (← links)
- Some results on generalised Whitney functions (Q1433003) (← links)
