Fetching the paper…
Reading the bibliography…
We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n^{O(ln n -ln epsilon)} time.
L.G. Valiant
1979
Earlier work this paper cites.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi
1999
Earlier work this paper cites.
A. Barvinok
1999
Earlier work this paper cites.
M. Fürer
2000
Earlier work this paper cites.
N. Linial, A. Samorodnitsky, and A. Wigderson
2000
Earlier work this paper cites.
M. Jerrum, A. Sinclair and E. Vigoda
2004
Cited alongside, same era.
L. Gurvits
2005
Cited alongside, same era.
A.D. Scott and A.D. Sokal
2005
Cited alongside, same era.
D. Gamarnik and D. Katz
2010
Cited alongside, same era.
A. Barvinok and A. Samorodnitsky
2011
Cited alongside, same era.
S. Aaronson and A. Arkhipov
2013
Later among the works it cites.
J.-Y. Cai, X. Chen and P. Lu
2013
Later among the works it cites.
L. Gurvits and A. Samorodnitsky
2013
Later among the works it cites.
2014
Closest in time.
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…