Fetching the paper…
Reading the bibliography…
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs.
L. Valiant, The complexity of computing the permanent
1979
Earlier work this paper cites.
by same author, The complexity of enumeration and reliability problems
1979
Earlier work this paper cites.
by same author, Completeness Classes in Algebra
1979
Earlier work this paper cites.
R. Baxter, Exactly solved models in statistical mechanics
1982
Earlier work this paper cites.
V. Jones, Hecke algebra representation of braid groups and link polynomials
1987
Earlier work this paper cites.
V. Turaev, The Yang-Baxter equation and invariants of links
1988
Earlier work this paper cites.
by same author, On knot invariants related to some statistical mechanical models
1989
Earlier work this paper cites.
F. Jaeger, D. Vertigan and D. Welsh, On the computational complexity of the Jones and Tutte polynomials
1990
Cited alongside, same era.
F. Y. Wu, Knot theory and statistical mechanics
1992
Cited alongside, same era.
N. Karmarkar, R. Karp, R. Lipton, L. Lovasz, M. Luby, A Monte-Carlo algorithm for estimating the permanent
1993
Cited alongside, same era.
D. Welsh, Complexity: knots, colourings and counting
1993
Cited alongside, same era.
V. Chari and A. Pressley, A guide to quantum groups
1994
Cited alongside, same era.
N. Alon, A. Frieze and D. Welsh, Polynomial time randomized approximation schemes for Tutte-Gröthendieck invariants: the dense case
D. Hochbaum, Approximation algorithms for NP-hard problems
1997
Later among the works it cites.
A. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor
1999
Later among the works it cites.
M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
2000
Later among the works it cites.
M. Freedman, A. Kitaev, M. Larsen, Z. Wang, Topological quantum computation
2003
Later among the works it cites.
M. Bordewich, M. Freedman, L. Lovasz, D. Welsh, Approximate Counting and Quantum Computation
2005
Later among the works it cites.
S. Garoufalidis, M. Loebl, Random walks and the colored Jones function
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1995
Cited alongside, same era.
D. Bar-Natan, S. Garoufalidis, On the Melvin-Morton-Rozansky Conjecture
1996
Cited alongside, same era.
D. Aharonov, I. Ared, The BQP-hardness of approximating the Jones polynomial
Cited in the paper.
G. Kuperberg, How hard is it to approximate the Jones polynomial?
Cited in the paper.
2005
Later among the works it cites.
D. Aharonov, V. Jones, Z. Landau, A polynomial quantum algorithm for approximating the Jones polynomial
2006
Later among the works it cites.