Cook–Levin theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cook–Levin theorem" in English language version.

Last modified: 20:45:50, 11 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

88doi.org

2^nd place

44semanticscholar.org

15^th place

8^th place

33neu.edu

low place

22ams.org

434^th place

249^th place

22worldcat.org

4^th place

11acm.org

1,200^th place

821^st place

11mathnet.ru

8,689^th place

low place

11ieee.org

912^th place

722^nd place

acm.org (Global: 1,200^th place; English: 821^st place)

portal.acm.org

Cook 1971. Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Garey & Johnson 1979, pp. 38–44, Section 2.6. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.
Garey & Johnson 1979. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.

doi.org (Global: 2^nd place; English: 2^nd place)

Cook 1971. Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.
Baker, Gill & Solovay 1975. Baker, T. P.; Gill, J.; Solovay, R. (1975). "Relativizations of the P = NP question". SIAM Journal on Computing. 4 (4): 431–442. doi:10.1137/0204037.
Levin (1973). Translated into English by Trakhtenbrot 1984, pp. 399–400, appendix. Levin, Leonid (1973). "Универсальные задачи перебора" [Universal search problems]. Problems of Information Transmission (in Russian). 9 (3): 115–116. 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. S2CID 950581.
Schnorr 1978. Schnorr, Claus-Peter (January 1978). "Satisfiability is quasilinear complete in NQL" (PDF). Journal of the ACM. 25 (1): 136–145. doi:10.1145/322047.322060. S2CID 1929802.
Pippenger & Fischer 1979. Pippenger, Nicholas; Fischer, Michael J. (April 1979). "Relations among complexity measures" (PDF). Journal of the ACM. 26 (2): 361–381. doi:10.1145/322123.322138. S2CID 2432526.
Robson 1991. Robson, John Michael (May 1991). "An $O(T\log T)$ reduction from RAM computations to satisfiability". Theoretical Computer Science. 82 (1): 141–149. doi:10.1016/0304-3975(91)90177-4.
Cook 1988. Cook, Stephen A. (January 1988). "Short propositional formulas represent nondeterministic computations" (PDF). Information Processing Letters. 26 (5): 269–270. doi:10.1016/0020-0190(88)90152-4.
Peterson, Reif & Azhar 2001. Peterson, Gary; Reif, John; Azhar, Salman (April 2001). "Lower bounds for multiplayer noncooperative games of incomplete information". Computers & Mathematics with Applications. 41 (7–8): 957–992. doi:10.1016/S0898-1221(00)00333-3.

ieee.org (Global: 912^th place; English: 722^nd place)

ieeexplore.ieee.org

Peterson & Reif 1979. Peterson, Gary L.; Reif, John H. (1979). "Multiple-person alternation". In Book, Ronald V.; Young, Paul (eds.). Proc. 20th Annual Symposium on Foundations of Computer Science (SFCS). IEEE. pp. 348–363.

mathnet.ru (Global: 8,689^th place; English: low place)

Levin (1973). Translated into English by Trakhtenbrot 1984, pp. 399–400, appendix. Levin, Leonid (1973). "Универсальные задачи перебора" [Universal search problems]. Problems of Information Transmission (in Russian). 9 (3): 115–116. 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. S2CID 950581.

neu.edu (Global: low place; English: low place)

ccs.neu.edu

Schnorr 1978. Schnorr, Claus-Peter (January 1978). "Satisfiability is quasilinear complete in NQL" (PDF). Journal of the ACM. 25 (1): 136–145. doi:10.1145/322047.322060. S2CID 1929802.
Pippenger & Fischer 1979. Pippenger, Nicholas; Fischer, Michael J. (April 1979). "Relations among complexity measures" (PDF). Journal of the ACM. 26 (2): 361–381. doi:10.1145/322123.322138. S2CID 2432526.
Cook 1988. Cook, Stephen A. (January 1988). "Short propositional formulas represent nondeterministic computations" (PDF). Information Processing Letters. 26 (5): 269–270. doi:10.1016/0020-0190(88)90152-4.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Cook 1971. Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663.
Levin (1973). Translated into English by Trakhtenbrot 1984, pp. 399–400, appendix. Levin, Leonid (1973). "Универсальные задачи перебора" [Universal search problems]. Problems of Information Transmission (in Russian). 9 (3): 115–116. 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. S2CID 950581.
Schnorr 1978. Schnorr, Claus-Peter (January 1978). "Satisfiability is quasilinear complete in NQL" (PDF). Journal of the ACM. 25 (1): 136–145. doi:10.1145/322047.322060. S2CID 1929802.
Pippenger & Fischer 1979. Pippenger, Nicholas; Fischer, Michael J. (April 1979). "Relations among complexity measures" (PDF). Journal of the ACM. 26 (2): 361–381. doi:10.1145/322123.322138. S2CID 2432526.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Garey & Johnson 1979, pp. 38–44, Section 2.6. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.
Garey & Johnson 1979. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.

Cook–Levin theorem (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)