P vs NP problema (Basque Wikipedia)

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

refsWebsite

Global rank Basque rank

2^nd place

6^th place

1,747^th place

2,113^th place

230^th place

195^th place

7,043^rd place

low place

332^nd place

208^th place

low place

83^rd place

3,063^rd place

low place

415^th place

619^th place

cornell.edu

ecommons.library.cornell.edu

Hartmanis, Juris. «Gödel, von Neumann, and the P = NP problem» 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. (June 2002). «The P=?NP poll.» SIGACT News 33 (2): 34–47. doi:10.1145/564585.564599..
Aviezri Fraenkel and D. Lichtenstein. (1981). «Computing a perfect strategy for n × n chess requires time exponential in n» Journal of Combinatorial Theory in: 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..
Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce. (2012). «The disjoint paths problem in quadratic time» Journal of Combinatorial Theory in: 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. doi:10.1016/0196-6774(87)90043-5..

mit.edu

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..

nsa.gov

NSA. (2012). Letters from John Nash. .

uchicago.edu

cs.uchicago.edu

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

uci.edu

ics.uci.edu

David Eppstein. Computational Complexity of Games and Puzzles. .

ueu.eus

Arruabarrena Santos, Rosa. (1997). Algoritmika. UEU ISBN 978-84-86967-82-6. (Noiz kontsultatua: 2023-12-20).

umd.edu

cs.umd.edu

William I. Gasarch. (June 2002). «The P=?NP poll.» SIGACT News 33 (2): 34–47. doi:10.1145/564585.564599..
William I. Gasarch. «The Second P=?NP poll» SIGACT News 74.
Guest Column: The Third P =? NP Poll1. .