Fetching the paper…
Reading the bibliography…
Understanding NP-complete problems is a central topic in computer science.
J. von Neuman and E. Wigner, Zeitschrift für Physik 30
1929
Earlier work this paper cites.
G. E. Mayer and M. Goeppert-Mayer, Statistical Mechanics (Wiley, New York, 1948)
1948
Earlier work this paper cites.
P. W. Anderson, Physical Review 109
1958
Earlier work this paper cites.
A. Messiah, Mécanique Quantique (Dunod, Paris, 1959)
1959
Earlier work this paper cites.
R. Abou-Chacra, D. J. Thouless, and P. W. Anderson, Journal of Physics C 6
1972
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York, NY, USA, 1979)
1979
Earlier work this paper cites.
P. W. Anderson, Local Moments and Localized States (World Scientific, 1992), Nobel Lectures, Physics 1971-1980
1980
Earlier work this paper cites.
K. Efetov, Soviet Physics - Journal of Experimental and Theoretical Physics 67
1988
Earlier work this paper cites.
P. W. Shor, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser (2000), e-print arXiv:quant-ph/0001106
2000
Cited alongside, same era.
G. Biroli, R. Monasson, and M. Weigt, European Physical Journal B 14
2000
Cited alongside, same era.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, Science 292
2001
Cited alongside, same era.
W. van Dam, M. Mosca, and U. Vazirani, in Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (IEEE, New York, 2001), pp. 279–287
2001
Cited alongside, same era.
W. van Dam and U. Vazirani (2003), unpublished manuscript
2003
Cited alongside, same era.
T. Hogg, Physical Review A 67
2003
Cited alongside, same era.
M. C. Bañuls, R. Orús, J. I. Latorre, A. Pérez, and P. Ruiz-Femenía, Physical Review A 73
2006
Later among the works it cites.
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, and S. Lloyd, SIAM Journal on Computing 37
2007
Later among the works it cites.
J. Raymond, A. Sportiello, and L. Zdeborová, Physical Review E 76
2007
Later among the works it cites.
E. Farhi, J. Goldstone, S. Gutmann, and D. Nagaj, International Journal of Quantum Information 6
2008
Later among the works it cites.
A. P. Young, S. Knysh, and V. N. Smelyanskiy, Physical Review Letters 101
2008
Later among the works it cites.
S. Arora and B. Barak, Computational Complexity: A Modern Approach (Cambridge University Press, 2009)
2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Reichardt, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (IEEE, New York, 2004), pp. 279–287
2004
Cited alongside, same era.
M. Žnidarič and M. Horvat, Physical Review A 73
2006
Cited alongside, same era.
Closest in time.
M. H. S. Amin and V. Choi (2009), e-print arXiv:0904.1387
2009
Closest in time.