Demando P = NP (Esperanto Wikipedia)

Analysis of information sources in references of the Wikipedia article "Demando P = NP" in Esperanto language version.

refsWebsite

Global rank Esperanto rank

2^nd place

7^th place

179^th place

100^th place

1^st place

1,185^th place

79^th place

1,747^th place

259^th place

26^th place

83^rd place

acm.org

R. E. Ladner "Sur la strukturo de polinoma tempo reducibility," J.ACM, 22, pp. 151–171, 1975. Korolario 1.1. ACM.

William I. Gasarch (Junio 2002). “The P=?NP poll. - La P=?NP baloto”, SIGACT News - SIGACT novaĵoj 33 (2), p. 34–47. doi:10.1145/1052796.1052804.
Berger B, Leighton T - (1998). “Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete - Proteino faldado en la HP modelo estas NP-plena”, J. Comput. Biol. 5 (1), p. 27–40. doi:10.1145/1052796.1052804. pmid 9541869.
L. R. Foulds (OCT., 1983). “The Heuristic Problem-Solving Approach - La heŭristika problemo-solvada maniero”, The Journal of the Operational Research Society - La ĵurnalo de la operacia esplora socio 34 (10), p. pp. 927–934. doi:10.2307/2580891.

L. R. Foulds (OCT., 1983). “The Heuristic Problem-Solving Approach - La heŭristika problemo-solvada maniero”, The Journal of the Operational Research Society - La ĵurnalo de la operacia esplora socio 34 (10), p. pp. 927–934. doi:10.2307/2580891.

Scott Aaronson. Komplikeca zoo: FP. "FP = FNP se kaj nur se P = NP". http://qwiki.stanford.edu/wiki/Complexity_Zoo#fp Arkivigite je 2010-07-26 per la retarkivo Wayback Machine

William I. Gasarch (Junio 2002). “The P=?NP poll. - La P=?NP baloto”, SIGACT News - SIGACT novaĵoj 33 (2), p. 34–47. doi:10.1145/1052796.1052804.

Scott Aaronson. Komplikeca zoo: FP. "FP = FNP se kaj nur se P = NP". http://qwiki.stanford.edu/wiki/Complexity_Zoo#fp Arkivigite je 2010-07-26 per la retarkivo Wayback Machine