P versus NP problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "P versus NP problem" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

13web.archive.org

1^st place

5psu.edu

207^th place

136^th place

5semanticscholar.org

11^th place

8^th place

4scottaaronson.com

low place

3umd.edu

1,747^th place

1,277^th place

2ams.org

451^st place

277^th place

2jstor.org

26^th place

20^th place

2nytimes.com

7^th place

2acm.org

1,185^th place

840^th place

2mit.edu

415^th place

327^th place

1archive-it.org

910^th place

593^rd place

1uchicago.edu

230^th place

214^th place

1mathnet.ru

8,783^rd place

low place

1nsa.gov

7,043^rd place

4,687^th place

1cornell.edu

332^nd place

246^th place

1ox.ac.uk

613^th place

456^th place

1uci.edu

3,063^rd place

2,041^st place

1fortnow.com

low place

1ed.ac.uk

1,871^st place

1,234^th place

1mcmaster.ca

6,572^nd place

4,351^st place

1claymath.org

8,402^nd place

8,241^st place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1nih.gov

4^th place

1stanford.edu

179^th place

183^rd place

1academia.edu

121^st place

142^nd place

1worldcat.org

5^th place

1informit.com

low place

7,385^th place

1ucsd.edu

1,933^rd place

1,342^nd place

1princeton.edu

741^st place

577^th place

1technion.ac.il

low place

1unizar.es

low place

1iitk.ac.in

6,454^th place

4,437^th place

1tue.nl

9,054^th place

6,363^rd place

1wired.co.uk

2,053^rd place

1,340^th place

1nd.edu

2,387^th place

1,479^th place

1computationalcomplexity.org

low place

1tv.com

509^th place

368^th place

academia.edu (Global: 121^st place; English: 142^nd place)

Johnson, David S. (August 2012). "A Brief History of NP-Completeness, 1954–2012". In Grötschel, M. (ed.). Optimization Stories (PDF). Documenta Mathematica. pp. 359–376. ISBN 978-3-936609-58-5. ISSN 1431-0643.

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.

mags.acm.org

Rosenberger, Jack (May 2012). "P vs. NP poll results". Communications of the ACM. 55 (5): 10.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Babai, László (2018). "Group, graphs, algorithms: the graph isomorphism problem". Proceedings of the International Congress of Mathematicians—Rio de Janeiro 2018. Vol. IV. Invited lectures. World Sci. Publ., Hackensack, NJ. pp. 3319–3336. MR 3966534.
Gondzio, Jacek; Terlaky, Tamás (1996). "3 A computational view of interior point methods". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. Vol. 4. New York: Oxford University Press. pp. 103–144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.

archive-it.org (Global: 910^th place; English: 593^rd place)

wayback.archive-it.org

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. CiteSeerX 10.1.1.156.767. doi:10.1145/1562164.1562186. S2CID 5969255. Archived from the original (PDF) on 24 February 2011. Retrieved 26 January 2010.

arxiv.org (Global: 69^th place; English: 59^th place)

See Horie, S.; Watanabe, O. (1997). "Hard instance generation for SAT". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 1350. Springer. pp. 22–31. arXiv:cs/9809117. Bibcode:1998cs........9117H. doi:10.1007/3-540-63890-3_4. ISBN 978-3-540-63890-2. for a reduction of factoring to SAT. A 512-bit factoring problem (8400 MIPS-years when factored) translates to a SAT problem of 63,652 variables and 406,860 clauses.

claymath.org (Global: 8,402^nd place; English: 8,241^st place)

Cook, Stephen (April 2000). "The P versus NP Problem" (PDF). Clay Mathematics Institute. Archived (PDF) from the original on 16 December 2013. Retrieved 18 October 2006.

computationalcomplexity.org (Global: low place; English: low place)

blog.computationalcomplexity.org

Gasarch, William (7 October 2013). "P vs NP is Elementary? No— P vs NP is ON Elementary". blog.computationalcomplexity.org. Retrieved 6 July 2018.

cornell.edu (Global: 332^nd place; English: 246^th place)

ecommons.library.cornell.edu

Hartmanis, Juris. "Gödel, von Neumann, and the P = NP problem" (PDF). Bulletin of the European Association for Theoretical Computer Science. 38: 101–107.

doi.org (Global: 2^nd place; English: 2^nd place)

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. CiteSeerX 10.1.1.156.767. doi:10.1145/1562164.1562186. S2CID 5969255. Archived from the original (PDF) on 24 February 2011. Retrieved 26 January 2010.
Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.
Gasarch, William I. (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599. S2CID 36828694. Archived (PDF) from the original on 15 June 2007.
Colbourn, Charles J. (1984). "The complexity of completing partial Latin squares". Discrete Applied Mathematics. 8 (1): 25–30. doi:10.1016/0166-218X(84)90075-1.
Holyer, I. (1981). "The NP-completeness of some edge-partition problems". SIAM J. Comput. 10 (4): 713–717. doi:10.1137/0210054.
Fraenkel, Aviezri; Lichtenstein, D. (1981). "Computing a perfect strategy for n × n chess requires time exponential in n". Journal of Combinatorial Theory. Series A. 31 (2): 199–214. doi:10.1016/0097-3165(81)90016-9.
Valiant, Leslie G. (1979). "The complexity of enumeration and reliability problems". SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.
Ladner, R.E. (1975). "On the structure of polynomial time reducibility". Journal of the ACM. 22: 151–171 See Corollary 1.1. doi:10.1145/321864.321877. S2CID 14352974.
Arvind, Vikraman; Kurur, Piyush P. (2006). "Graph isomorphism is in SPP". Information and Computation. 204 (5): 835–852. doi:10.1016/j.ic.2006.02.002.
Schöning, Uwe (1988). "Graph isomorphism is in the low hierarchy". Journal of Computer and System Sciences. 37 (3): 312–323. doi:10.1016/0022-0000(88)90010-4.
Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (2012). "The disjoint paths problem in quadratic time". Journal of Combinatorial Theory. Series B. 102 (2): 424–435. doi:10.1016/j.jctb.2011.07.004.
Johnson, David S. (1987). "The NP-completeness column: An ongoing guide (edition 19)". Journal of Algorithms. 8 (2): 285–303. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.
See Horie, S.; Watanabe, O. (1997). "Hard instance generation for SAT". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 1350. Springer. pp. 22–31. arXiv:cs/9809117. Bibcode:1998cs........9117H. doi:10.1007/3-540-63890-3_4. ISBN 978-3-540-63890-2. for a reduction of factoring to SAT. A 512-bit factoring problem (8400 MIPS-years when factored) translates to a SAT problem of 63,652 variables and 406,860 clauses.
See, for example, Massacci, F.; Marraro, L. (2000). "Logical cryptanalysis as a SAT problem". Journal of Automated Reasoning. 24 (1): 165–203. CiteSeerX 10.1.1.104.962. doi:10.1023/A:1006326723002. S2CID 3114247. in which an instance of DES is encoded as a SAT problem with 10336 variables and 61935 clauses. A 3DES problem instance would be about 3 times this size.
De, Debapratim; Kumarasubramanian, Abishek; Venkatesan, Ramarathnam (2007). "Inversion attacks on secure hash functions using SAT solvers". Theory and Applications of Satisfiability Testing – SAT 2007. International Conference on Theory and Applications of Satisfiability Testing. Springer. pp. 377–382. doi:10.1007/978-3-540-72788-0_36.
Berger, B.; Leighton, T. (1998). "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete". Journal of Computational Biology. 5 (1): 27–40. CiteSeerX 10.1.1.139.5547. doi:10.1089/cmb.1998.5.27. PMID 9541869.
Foulds, L. R. (October 1983). "The Heuristic Problem-Solving Approach". Journal of the Operational Research Society. 34 (10): 927–934. doi:10.2307/2580891. JSTOR 2580891.
Baker, T. P.; Gill, J.; Solovay, R. (1975). "Relativizations of the P =? NP Question". SIAM Journal on Computing. 4 (4): 431–442. doi:10.1137/0204037.
Razborov, Alexander A.; Steven Rudich (1997). "Natural proofs". Journal of Computer and System Sciences. 55 (1): 24–35. doi:10.1006/jcss.1997.1494.
Aaronson, S.; Wigderson, A. (2008). Algebrization: A New Barrier in Complexity Theory (PDF). Proceedings of ACM STOC'2008. pp. 731–740. doi:10.1145/1374376.1374481. Archived (PDF) from the original on 21 February 2008.
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004). "PRIMES is in P" (PDF). Annals of Mathematics. 160 (2): 781–793. doi:10.4007/annals.2004.160.781. JSTOR 3597229. Archived (PDF) from the original on 26 September 2006.

ed.ac.uk (Global: 1,871^st place; English: 1,234^th place)

maths.ed.ac.uk

Gondzio, Jacek; Terlaky, Tamás (1996). "3 A computational view of interior point methods". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. Vol. 4. New York: Oxford University Press. pp. 103–144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.

fortnow.com (Global: low place; English: low place)

weblog.fortnow.com

Lance Fortnow. Computational Complexity Blog: Complexity Class of the Week: Factoring. 13 September 2002.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

See Horie, S.; Watanabe, O. (1997). "Hard instance generation for SAT". Algorithms and Computation. Lecture Notes in Computer Science. Vol. 1350. Springer. pp. 22–31. arXiv:cs/9809117. Bibcode:1998cs........9117H. doi:10.1007/3-540-63890-3_4. ISBN 978-3-540-63890-2. for a reduction of factoring to SAT. A 512-bit factoring problem (8400 MIPS-years when factored) translates to a SAT problem of 63,652 variables and 406,860 clauses.

iitk.ac.in (Global: 6,454^th place; English: 4,437^th place)

cse.iitk.ac.in

Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004). "PRIMES is in P" (PDF). Annals of Mathematics. 160 (2): 781–793. doi:10.4007/annals.2004.160.781. JSTOR 3597229. Archived (PDF) from the original on 26 September 2006.

informit.com (Global: low place; English: 7,385^th place)

Knuth, Donald E. (20 May 2014). Twenty Questions for Donald Knuth. InformIT. Retrieved 20 July 2014.

jstor.org (Global: 26^th place; English: 20^th place)

Foulds, L. R. (October 1983). "The Heuristic Problem-Solving Approach". Journal of the Operational Research Society. 34 (10): 927–934. doi:10.2307/2580891. JSTOR 2580891.
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004). "PRIMES is in P" (PDF). Annals of Mathematics. 160 (2): 781–793. doi:10.4007/annals.2004.160.781. JSTOR 3597229. Archived (PDF) from the original on 26 September 2006.

mathnet.ru (Global: 8,783^rd place; English: low place)

Levin, L. A. (1973). Универсальные задачи перебора [Problems of Information Transmission]. Пробл. передачи информ (in Russian). 9 (3): 115–116.

mcmaster.ca (Global: 6,572^nd place; English: 4,351^st place)

cas.mcmaster.ca

Gondzio, Jacek; Terlaky, Tamás (1996). "3 A computational view of interior point methods". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. Vol. 4. New York: Oxford University Press. pp. 103–144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.

mit.edu (Global: 415^th place; English: 327^th place)

lcs.mit.edu

Fischer, Michael J.; Rabin, Michael O. (1974). "Super-Exponential Complexity of Presburger Arithmetic". Proceedings of the SIAM-AMS Symposium in Applied Mathematics. 7: 27–41. Archived from the original on 15 September 2006. Retrieved 15 October 2017.

news.mit.edu

Hardesty, Larry (29 October 2009). "Explained: P vs. NP".

nd.edu (Global: 2,387^th place; English: 1,479^th place)

science.nd.edu

Shadia, Ajam (13 September 2013). "What is the P vs. NP problem? Why is it important?".

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Berger, B.; Leighton, T. (1998). "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete". Journal of Computational Biology. 5 (1): 27–40. CiteSeerX 10.1.1.139.5547. doi:10.1089/cmb.1998.5.27. PMID 9541869.

nsa.gov (Global: 7,043^rd place; English: 4,687^th place)

NSA (2012). "Letters from John Nash" (PDF). Archived (PDF) from the original on 9 November 2018.

nytimes.com (Global: 7^th place; English: 7^th place)

Markoff, John (8 October 2009). "Prizes Aside, the P-NP Puzzler Has Consequences". The New York Times.
Markoff, John (16 August 2010). "Step 1: Post Elusive Proof. Step 2: Watch Fireworks". The New York Times. Retrieved 20 September 2010.

ox.ac.uk (Global: 613^th place; English: 456^th place)

cs.ox.ac.uk

"MSc course: Foundations of Computer Science". www.cs.ox.ac.uk. Retrieved 25 May 2020.

princeton.edu (Global: 741^st place; English: 577^th place)

intractability.princeton.edu

"Tentative program for the workshop on "Complexity and Cryptography: Status of Impagliazzo's Worlds"". Archived from the original on 15 November 2013.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. CiteSeerX 10.1.1.156.767. doi:10.1145/1562164.1562186. S2CID 5969255. Archived from the original (PDF) on 24 February 2011. Retrieved 26 January 2010.
Gasarch, William I. (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599. S2CID 36828694. Archived (PDF) from the original on 15 June 2007.
Johnson, David S. (1987). "The NP-completeness column: An ongoing guide (edition 19)". Journal of Algorithms. 8 (2): 285–303. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.
See, for example, Massacci, F.; Marraro, L. (2000). "Logical cryptanalysis as a SAT problem". Journal of Automated Reasoning. 24 (1): 165–203. CiteSeerX 10.1.1.104.962. doi:10.1023/A:1006326723002. S2CID 3114247. in which an instance of DES is encoded as a SAT problem with 10336 variables and 61935 clauses. A 3DES problem instance would be about 3 times this size.
Berger, B.; Leighton, T. (1998). "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete". Journal of Computational Biology. 5 (1): 27–40. CiteSeerX 10.1.1.139.5547. doi:10.1089/cmb.1998.5.27. PMID 9541869.

scottaaronson.com (Global: low place; English: low place)

Aaronson, Scott. "PHYS771 Lecture 6: P, NP, and Friends". Retrieved 27 August 2007.
Aaronson, Scott (4 September 2006). "Reasons to believe"., point 9.
Aaronson, S.; Wigderson, A. (2008). Algebrization: A New Barrier in Complexity Theory (PDF). Proceedings of ACM STOC'2008. pp. 731–740. doi:10.1145/1374376.1374481. Archived (PDF) from the original on 21 February 2008.
Aaronson, Scott. "Is P Versus NP Formally Independent?" (PDF). Archived (PDF) from the original on 16 January 2017..

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. CiteSeerX 10.1.1.156.767. doi:10.1145/1562164.1562186. S2CID 5969255. Archived from the original (PDF) on 24 February 2011. Retrieved 26 January 2010.
Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.
Gasarch, William I. (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599. S2CID 36828694. Archived (PDF) from the original on 15 June 2007.
Ladner, R.E. (1975). "On the structure of polynomial time reducibility". Journal of the ACM. 22: 151–171 See Corollary 1.1. doi:10.1145/321864.321877. S2CID 14352974.
See, for example, Massacci, F.; Marraro, L. (2000). "Logical cryptanalysis as a SAT problem". Journal of Automated Reasoning. 24 (1): 165–203. CiteSeerX 10.1.1.104.962. doi:10.1023/A:1006326723002. S2CID 3114247. in which an instance of DES is encoded as a SAT problem with 10336 variables and 61935 clauses. A 3DES problem instance would be about 3 times this size.

stanford.edu (Global: 179^th place; English: 183^rd place)

cs.stanford.edu

History of this letter and its translation from Sipser, Michael. "The History and Status of the P versus NP question" (PDF). Archived (PDF) from the original on 2 February 2014.

technion.ac.il (Global: low place; English: low place)

cs.technion.ac.il

Ben-David, Shai; Halevi, Shai (1992). On the independence of P versus NP. Technion (Technical report). Vol. 714. Archived from the original (GZIP) on 2 March 2012..

tue.nl (Global: 9,054^th place; English: 6,363^rd place)

wscor.win.tue.nl

Gerhard J. Woeginger. "The P-versus-NP page". Retrieved 24 June 2018.

tv.com (Global: 509^th place; English: 368^th place)

Kirkpatrick, Noel (4 October 2013). "Elementary Solve for X Review: Sines of Murder". TV.com. Retrieved 6 July 2018.

uchicago.edu (Global: 230^th place; English: 214^th place)

cs.uchicago.edu

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. CiteSeerX 10.1.1.156.767. doi:10.1145/1562164.1562186. S2CID 5969255. Archived from the original (PDF) on 24 February 2011. Retrieved 26 January 2010.

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

ics.uci.edu

Eppstein, David. "Computational Complexity of Games and Puzzles".

ucsd.edu (Global: 1,933^rd place; English: 1,342^nd place)

cseweb.ucsd.edu

R. Impagliazzo, "A personal view of average-case complexity", p. 134, 10th Annual Structure in Complexity Theory Conference (SCT'95), 1995.

umd.edu (Global: 1,747^th place; English: 1,277^th place)

cs.umd.edu

Gasarch, William I. (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599. S2CID 36828694. Archived (PDF) from the original on 15 June 2007.
Gasarch, William I. "The Second P=?NP poll" (PDF). SIGACT News. 74. Archived (PDF) from the original on 24 January 2014.
"Guest Column: The Third P =? NP Poll1" (PDF). Archived (PDF) from the original on 31 March 2019. Retrieved 25 May 2020.

unizar.es (Global: low place; English: low place)

Elvira Mayordomo. "P versus NP" Archived 16 February 2012 at the Wayback Machine Monografías de la Real Academia de Ciencias de Zaragoza 26: 57–68 (2004).

web.archive.org (Global: 1^st place; English: 1^st place)

NSA (2012). "Letters from John Nash" (PDF). Archived (PDF) from the original on 9 November 2018.
Gasarch, William I. (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599. S2CID 36828694. Archived (PDF) from the original on 15 June 2007.
Gasarch, William I. "The Second P=?NP poll" (PDF). SIGACT News. 74. Archived (PDF) from the original on 24 January 2014.
"Guest Column: The Third P =? NP Poll1" (PDF). Archived (PDF) from the original on 31 March 2019. Retrieved 25 May 2020.
Fischer, Michael J.; Rabin, Michael O. (1974). "Super-Exponential Complexity of Presburger Arithmetic". Proceedings of the SIAM-AMS Symposium in Applied Mathematics. 7: 27–41. Archived from the original on 15 September 2006. Retrieved 15 October 2017.
Cook, Stephen (April 2000). "The P versus NP Problem" (PDF). Clay Mathematics Institute. Archived (PDF) from the original on 16 December 2013. Retrieved 18 October 2006.
History of this letter and its translation from Sipser, Michael. "The History and Status of the P versus NP question" (PDF). Archived (PDF) from the original on 2 February 2014.
"Tentative program for the workshop on "Complexity and Cryptography: Status of Impagliazzo's Worlds"". Archived from the original on 15 November 2013.
Aaronson, S.; Wigderson, A. (2008). Algebrization: A New Barrier in Complexity Theory (PDF). Proceedings of ACM STOC'2008. pp. 731–740. doi:10.1145/1374376.1374481. Archived (PDF) from the original on 21 February 2008.
Aaronson, Scott. "Is P Versus NP Formally Independent?" (PDF). Archived (PDF) from the original on 16 January 2017..
Ben-David, Shai; Halevi, Shai (1992). On the independence of P versus NP. Technion (Technical report). Vol. 714. Archived from the original (GZIP) on 2 March 2012..
Elvira Mayordomo. "P versus NP" Archived 16 February 2012 at the Wayback Machine Monografías de la Real Academia de Ciencias de Zaragoza 26: 57–68 (2004).
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004). "PRIMES is in P" (PDF). Annals of Mathematics. 160 (2): 781–793. doi:10.4007/annals.2004.160.781. JSTOR 3597229. Archived (PDF) from the original on 26 September 2006.

wired.co.uk (Global: 2,053^rd place; English: 1,340^th place)

Geere, Duncan (26 April 2012). "'Travelling Salesman' movie considers the repercussions if P equals NP". Wired UK. Retrieved 26 April 2012.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Johnson, David S. (August 2012). "A Brief History of NP-Completeness, 1954–2012". In Grötschel, M. (ed.). Optimization Stories (PDF). Documenta Mathematica. pp. 359–376. ISBN 978-3-936609-58-5. ISSN 1431-0643.

P versus NP problem (English Wikipedia)

academia.edu (Global: 121st place; English: 142nd place)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

mags.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive-it.org (Global: 910th place; English: 593rd place)

wayback.archive-it.org

arxiv.org (Global: 69th place; English: 59th place)

claymath.org (Global: 8,402nd place; English: 8,241st place)

computationalcomplexity.org (Global: low place; English: low place)

blog.computationalcomplexity.org

cornell.edu (Global: 332nd place; English: 246th place)

ecommons.library.cornell.edu

doi.org (Global: 2nd place; English: 2nd place)

ed.ac.uk (Global: 1,871st place; English: 1,234th place)

maths.ed.ac.uk

fortnow.com (Global: low place; English: low place)

weblog.fortnow.com

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

iitk.ac.in (Global: 6,454th place; English: 4,437th place)

cse.iitk.ac.in

informit.com (Global: low place; English: 7,385th place)

jstor.org (Global: 26th place; English: 20th place)

mathnet.ru (Global: 8,783rd place; English: low place)

mcmaster.ca (Global: 6,572nd place; English: 4,351st place)

cas.mcmaster.ca

mit.edu (Global: 415th place; English: 327th place)

lcs.mit.edu

news.mit.edu

nd.edu (Global: 2,387th place; English: 1,479th place)

science.nd.edu

nih.gov (Global: 4th place; English: 4th place)

pubmed.ncbi.nlm.nih.gov

nsa.gov (Global: 7,043rd place; English: 4,687th place)

nytimes.com (Global: 7th place; English: 7th place)

ox.ac.uk (Global: 613th place; English: 456th place)

cs.ox.ac.uk

princeton.edu (Global: 741st place; English: 577th place)

intractability.princeton.edu

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

scottaaronson.com (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

stanford.edu (Global: 179th place; English: 183rd place)

cs.stanford.edu

technion.ac.il (Global: low place; English: low place)

cs.technion.ac.il

tue.nl (Global: 9,054th place; English: 6,363rd place)

wscor.win.tue.nl

tv.com (Global: 509th place; English: 368th place)

uchicago.edu (Global: 230th place; English: 214th place)

cs.uchicago.edu

uci.edu (Global: 3,063rd place; English: 2,041st place)

ics.uci.edu

ucsd.edu (Global: 1,933rd place; English: 1,342nd place)

cseweb.ucsd.edu

umd.edu (Global: 1,747th place; English: 1,277th place)

cs.umd.edu

unizar.es (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

wired.co.uk (Global: 2,053rd place; English: 1,340th place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

academia.edu (Global: 121^st place; English: 142^nd place)

acm.org (Global: 1,185^th place; English: 840^th place)

ams.org (Global: 451^st place; English: 277^th place)

archive-it.org (Global: 910^th place; English: 593^rd place)

arxiv.org (Global: 69^th place; English: 59^th place)

claymath.org (Global: 8,402^nd place; English: 8,241^st place)

cornell.edu (Global: 332^nd place; English: 246^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ed.ac.uk (Global: 1,871^st place; English: 1,234^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

iitk.ac.in (Global: 6,454^th place; English: 4,437^th place)

informit.com (Global: low place; English: 7,385^th place)

jstor.org (Global: 26^th place; English: 20^th place)

mathnet.ru (Global: 8,783^rd place; English: low place)

mcmaster.ca (Global: 6,572^nd place; English: 4,351^st place)

mit.edu (Global: 415^th place; English: 327^th place)

nd.edu (Global: 2,387^th place; English: 1,479^th place)

nih.gov (Global: 4^th place; English: 4^th place)

nsa.gov (Global: 7,043^rd place; English: 4,687^th place)

nytimes.com (Global: 7^th place; English: 7^th place)

ox.ac.uk (Global: 613^th place; English: 456^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

stanford.edu (Global: 179^th place; English: 183^rd place)

tue.nl (Global: 9,054^th place; English: 6,363^rd place)

tv.com (Global: 509^th place; English: 368^th place)

uchicago.edu (Global: 230^th place; English: 214^th place)

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

ucsd.edu (Global: 1,933^rd place; English: 1,342^nd place)

umd.edu (Global: 1,747^th place; English: 1,277^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

wired.co.uk (Global: 2,053^rd place; English: 1,340^th place)

worldcat.org (Global: 5^th place; English: 5^th place)