Sign In

Login

Password

Forgot Password ? Sign Up

Problem P vs NP (Polish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problem P vs NP" in Polish language version.

Last modified:

Ref.Un. Ref.Website
Global rank Polish rank
2621doi.org
2nd place
5th place
2418web.archive.org
1st place
1st place
51claymath.org
low place
7,418th place
32mit.edu
476th place
1,041st place
22ucsd.edu
2,146th place
3,826th place
22scottaaronson.com
low place
low place
21computationalcomplexity.org
low place
low place
11nii.ac.jp
195th place
low place
11nsa.gov
7,332nd place
low place
11cornell.edu
308th place
962nd place
11iitk.ac.in
low place
low place
11nih.gov
5th place
7th place
11uni-bielefeld.de
9,541st place
7,075th place
11jstor.org
23rd place
147th place
11umd.edu
1,356th place
2,559th place
11tue.nl
9,533rd place
low place
11technion.ac.il
low place
low place
11ronfagin.com
low place
low place
11unizar.es
9,550th place
low place

claymath.org (Global: low place; Polish: 7,418th place)

  • Stephen Cook, The P Versus NP Problem, Clay Mathematics Institute, kwiecień 2000 [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-05-01] (ang.).

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

blog.computationalcomplexity.org

cornell.edu (Global: 308th place; Polish: 962nd place)

ecommons.cornell.edu

doi.org (Global: 2nd place; Polish: 5th place)

  • Lance Fortnow, The status of the P versus NP problem, „Communications of the ACM”, 52 (9), 2009, s. 78–86, DOI: 10.1145/1562164.1562186 (ang.).
  • The complexity of theorem-proving procedures, [w:] Stephen A. Cook, Proceedings of the Third Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1971, s. 151–158, DOI: 10.1145/800157.805047, ISBN 978-1-4503-7464-4 (ang.).
  • Russell Impagliazzo, Ramamohan Paturi, Francis Zane, Which Problems Have Strongly Exponential Complexity?, „Journal of Computer and System Sciences”, 63 (4), 2001, s. 512–530, DOI: 10.1006/jcss.2001.1774 [dostęp 2026-05-09] [zarchiwizowane z adresu 2024-04-16] (ang.).
  • Charles J. Colbourn, The complexity of completing partial Latin squares, „Discrete Applied Mathematics”, 8 (1), 1984, s. 25–30, DOI: 10.1016/0166-218X(84)90075-1 (ang.).
  • Reducibility among combinatorial problems, [w:] Richard M. Karp, Complexity of Computer Computations, 1972, s. 85–103, DOI: 10.1007/978-1-4684-2001-2_9 (ang.).
  • Richard E. Ladner, On the structure of polynomial time reducibility, „Journal of the ACM”, 22 (1), 1975, s. 151–171, DOI: 10.1145/321864.321877 (ang.).
  • Uwe Schöning, Graph isomorphism is in the low hierarchy, „Journal of Computer and System Sciences”, 37 (3), 1988, s. 312–323, DOI: 10.1016/0022-0000(88)90010-4 (ang.).
  • Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, „SIAM Journal on Computing”, 26 (5), 1997, s. 1484–1509, DOI: 10.1137/S0097539795293172 (ang.).
  • Manindra Agrawal, Neeraj Kayal, Nitin Saxena, PRIMES is in P, „Annals of Mathematics”, 160 (2), 2004, s. 781–793, DOI: 10.4007/annals.2004.160.781 [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-04-24] (ang.).
  • Aviezri S. Fraenkel, David Lichtenstein, Computing a perfect strategy for n × n chess requires time exponential in n, „Journal of Combinatorial Theory, Series A”, 31 (2), 1981, s. 199–214, DOI: 10.1016/0097-3165(81)90016-9 (ang.).
  • Leslie G. Valiant, The complexity of enumeration and reliability problems, „SIAM Journal on Computing”, 8 (3), 1979, s. 410–421, DOI: 10.1137/0208032 (ang.).
  • Seinosuke Toda, PP is as hard as the polynomial-time hierarchy, „SIAM Journal on Computing”, 20 (5), 1991, s. 865–877, DOI: 10.1137/0220053 (ang.).
  • Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy, Proof verification and the hardness of approximation problems, „Journal of the ACM”, 45 (3), 1998, s. 501–555, DOI: 10.1145/278298.278306 (ang.).
  • Ethan Bernstein, Umesh Vazirani, Quantum complexity theory, „SIAM Journal on Computing”, 26 (5), 1997, s. 1411–1473, DOI: 10.1137/S0097539796300921 (ang.).
  • Completeness classes in algebra, [w:] Leslie G. Valiant, Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1979, s. 249–261, DOI: 10.1145/800135.804419 (ang.).
  • Bonnie Berger, Tom Leighton, Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete, „Journal of Computational Biology”, 5 (1), 1998, s. 27–40, DOI: 10.1089/cmb.1998.5.27, PMID: 9541869 (ang.).
  • L.R. Foulds, The Heuristic Problem-Solving Approach, „Journal of the Operational Research Society”, 34 (10), 1983, s. 927–934, DOI: 10.2307/2580891, JSTOR: 2580891 (ang.).
  • Theodore Baker, John Gill, Robert Solovay, Relativizations of the P =? NP Question, „SIAM Journal on Computing”, 4 (4), 1975, s. 431–442, DOI: 10.1137/0204037 (ang.).
  • Alexander A. Razborov, Steven Rudich, Natural proofs, „Journal of Computer and System Sciences”, 55 (1), 1997, s. 24–35, DOI: 10.1006/jcss.1997.1494 (ang.).
  • Scott Aaronson, Avi Wigderson, Algebrization: A New Barrier in Complexity Theory, „Proceedings of the 40th Annual ACM Symposium on Theory of Computing”, 2008, s. 731–740, DOI: 10.1145/1374376.1374481 [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-05-19] (ang.).
  • Neil Immerman, Languages that capture complexity classes, „SIAM Journal on Computing”, 16 (4), 1987, s. 760–778, DOI: 10.1137/0216051 (ang.).

iitk.ac.in (Global: low place; Polish: low place)

cse.iitk.ac.in

  • Manindra Agrawal, Neeraj Kayal, Nitin Saxena, PRIMES is in P, „Annals of Mathematics”, 160 (2), 2004, s. 781–793, DOI: 10.4007/annals.2004.160.781 [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-04-24] (ang.).

jstor.org (Global: 23rd place; Polish: 147th place)

  • L.R. Foulds, The Heuristic Problem-Solving Approach, „Journal of the Operational Research Society”, 34 (10), 1983, s. 927–934, DOI: 10.2307/2580891, JSTOR: 2580891 (ang.).

mit.edu (Global: 476th place; Polish: 1,041st place)

news.mit.edu

  • Explained: P vs. NP [online], MIT News, 29 października 2009 [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-05-13] (ang.).

lcs.mit.edu

nih.gov (Global: 5th place; Polish: 7th place)

ncbi.nlm.nih.gov

  • Bonnie Berger, Tom Leighton, Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete, „Journal of Computational Biology”, 5 (1), 1998, s. 27–40, DOI: 10.1089/cmb.1998.5.27, PMID: 9541869 (ang.).

nii.ac.jp (Global: 195th place; Polish: low place)

cir.nii.ac.jp

nsa.gov (Global: 7,332nd place; Polish: low place)

  • National Security Agency, Letters from John Nash, National Security Agency, 26 kwietnia 2012 [dostęp 2026-05-09] [zarchiwizowane z adresu 2021-09-18] (ang.).

ronfagin.com (Global: low place; Polish: low place)

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

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

cs.technion.ac.il

tue.nl (Global: 9,533rd place; Polish: low place)

wscor.win.tue.nl

  • Gerhard J. Woeginger, The P-versus-NP page [online] [dostęp 2026-05-09] [zarchiwizowane z adresu 2026-05-18] (ang.).

ucsd.edu (Global: 2,146th place; Polish: 3,826th place)

cseweb.ucsd.edu

umd.edu (Global: 1,356th place; Polish: 2,559th place)

cs.umd.edu

uni-bielefeld.de (Global: 9,541st place; Polish: 7,075th place)

math.uni-bielefeld.de

unizar.es (Global: 9,550th place; Polish: low place)

  • Elvira Mayordomo, P versus NP, „Monografías de la Real Academia de Ciencias de Zaragoza”, 26, 2004, s. 57–68 [dostęp 2026-05-09] [zarchiwizowane z adresu 2012-02-16] (ang.).

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