P versus NP (Galician Wikipedia)

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

refsWebsite

Global rank Galician rank

3rjlipton.wordpress.com

low place

3acm.org

1,185^th place

2,890^th place

2doi.org

2^nd place

7^th place

2umd.edu

1,747^th place

2,407^th place

2nytimes.com

7^th place

32^nd place

1web.archive.org

1^st place

1nsa.gov

7,043^rd place

7,461^st place

1cornell.edu

332^nd place

317^th place

1tue.nl

9,054^th place

low place

1michaelnielsen.org

low place

1sciencenews.org

3,410^th place

2,128^th place

1newyorker.com

146^th place

662^nd place

acm.org

portal.acm.org

R. E. Ladner "On the structure of polynomial time reducibility," Journal of the ACM 22, pp. 151–171, 1975. Corollary 1.1. ACM site.
Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158.

dl.acm.org

Fortnow, Lance (2009). "The status of the P versus NP problem". Communications of the ACM 52 (9): 78–86. doi:10.1145/1562164.1562186.

cornell.edu

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

dx.doi.org

Fortnow, Lance (2009). "The status of the P versus NP problem". Communications of the ACM 52 (9): 78–86. doi:10.1145/1562164.1562186.
William I. Gasarch (xuño de 2002). "The P=?NP poll." (PDF). SIGACT News 33 (2): 34–47. doi:10.1145/1052796.1052804. Consultado o 29-122008.

michaelnielsen.org

Polymath Project wiki. "Deolalikar's P vs NP paper".

newyorker.com

Alexander Nazaryan (2-5-2013). "A Most Profound Math Problem". Consultado o 1-5-2014.

nsa.gov

NSA (2012). "Letters from John Nash" (PDF). Arquivado dende o orixinal (PDF) o 07 de agosto de 2017. Consultado o 07 de agosto de 2017.

nytimes.com

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

rjlipton.wordpress.com

Dick Lipton (12-8-2010). "Fatal Flaws in Deolalikar's Proof?".
Dick Lipton (15-9-2010). "An Update on Vinay Deolalikar's Proof". Consultado o 31-12-2010.
Gödel’s Lost Letter and P=NP, Update on Deolalikar’s Proof that P≠NP

sciencenews.org

Science News, "Crowdsourcing peer review"

tue.nl

win.tue.nl

Gerhard J. Woeginger. "The P-versus-NP page". Consultado o 25-5-2014.

umd.edu

cs.umd.edu

William I. Gasarch (xuño de 2002). "The P=?NP poll." (PDF). SIGACT News 33 (2): 34–47. doi:10.1145/1052796.1052804. Consultado o 29-122008.
William I. Gasarch. "The Second P=?NP poll" (PDF). SIGACT News 74.

web.archive.org

NSA (2012). "Letters from John Nash" (PDF). Arquivado dende o orixinal (PDF) o 07 de agosto de 2017. Consultado o 07 de agosto de 2017.