Théorème de Cook (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Théorème de Cook" in French language version.

refsWebsite

Global rank French rank

low place

8,783^rd place

low place

2^nd place

3^rd place

4mhz.de

(en) Stephen Cook, The complexity of theorem proving procedures, Proceedings of the third annual ACM symposium on Theory of computing (1971), pages 151–158.

(en) Leonid Levin, « Universal search problems (russe : Универсальные задачи перебора, Universal'nye perebornye zadachi) », Problems of Information Transmission (russe : Проблемы передачи информации, Problemy Peredachi Informatsii), vol. 9, n^o 3,‎ 1973, p. 115–116 [PDF] (ru), traduit en anglais par (en) B. A. Trakhtenbrot, « A survey of Russian approaches to perebor (brute-force searches) algorithms », Annals of the History of Computing, vol. 6, n^o 4,‎ 1984, p. 384–400 (DOI 10.1109/MAHC.1984.10036).

(en) Leonid Levin, « Universal search problems (russe : Универсальные задачи перебора, Universal'nye perebornye zadachi) », Problems of Information Transmission (russe : Проблемы передачи информации, Problemy Peredachi Informatsii), vol. 9, n^o 3,‎ 1973, p. 115–116 [PDF] (ru), traduit en anglais par (en) B. A. Trakhtenbrot, « A survey of Russian approaches to perebor (brute-force searches) algorithms », Annals of the History of Computing, vol. 6, n^o 4,‎ 1984, p. 384–400 (DOI 10.1109/MAHC.1984.10036).