قضیه کوک–لوین (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "قضیه کوک–لوین" in Persian language version.

refsWebsite

Global rank Persian rank

2^nd place

1,185^th place

1,084^th place

1^st place

580^th place

676^th place

6^th place

9^th place

acm.org

Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158.

Garey, Michael R. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. ISBN 0-7167-1045-5. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems". In Raymond E. Miller and James W. Thatcher (editors) (ed.). Complexity of Computer Computations (PDF). New York: Plenum. pp. 85–103. ISBN 0-306-30707-3. Archived from the original (PDF) on 29 June 2011. Retrieved 30 June 2011. {{cite book}}: |editor= has generic name (help)

T. P. Baker (1975). "Relativizations of the P = NP question". SIAM Journal on Computing. 4 (4): 431–442. doi:10.1137/0204037. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
Levin, Leonid (1973). "Universal search problems (روسی: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (روسی: Проблемы передачи информации, Problemy Peredachi Informatsii). 9 (3): 265–266. (روسی), translated into English by Trakhtenbrot, B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. 6 (4): 384–400. doi:10.1109/MAHC.1984.10036.

Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems". In Raymond E. Miller and James W. Thatcher (editors) (ed.). Complexity of Computer Computations (PDF). New York: Plenum. pp. 85–103. ISBN 0-306-30707-3. Archived from the original (PDF) on 29 June 2011. Retrieved 30 June 2011. {{cite book}}: |editor= has generic name (help)