庫克-李文定理 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "庫克-李文定理" in Chinese language version.

refsWebsite

Global rank Chinese rank

1^st place

2^nd place

23^rd place

580^th place

642^nd place

1,185^th place

809^th place

acm.org

Cook, Stephen. The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing. 1971: 151–158 [2011-07-20]. （原始内容存档于2020-08-06）.

Karp, Richard M. Reducibility Among Combinatorial Problems. Raymond E. Miller and James W. Thatcher (editors) (编). Complexity of Computer Computations (PDF). New York: Plenum. 1972: 85–103 [2011-07-20]. ISBN 0306307073. （原始内容 (PDF)存档于2011-06-29）. 引用错误：带有name属性“Karp”的<ref>标签用不同内容定义了多次

T. P. Baker; J. Gill, R. Solovay. Relativizations of the P = NP question. SIAM Journal on Computing. 1975, 4 (4): 431–442. doi:10.1137/0204037.
Levin, Leonid. Universal search problems (俄语：Универсальные задачи перебора, Universal'nye perebornye zadachi). Problems of Information Transmission (俄语：Проблемы передачи информации, Problemy Peredachi Informatsii). 1973, 9 (3): 265–266. （俄文）由Trakhtenbrot, B. A. A survey of Russian approaches to perebor（brute-force searches）algorithms. Annals of the History of Computing. 1984, 6 (4): 384–400. doi:10.1109/MAHC.1984.10036.

Karp, Richard M. Reducibility Among Combinatorial Problems. Raymond E. Miller and James W. Thatcher (editors) (编). Complexity of Computer Computations (PDF). New York: Plenum. 1972: 85–103 [2011-07-20]. ISBN 0306307073. （原始内容 (PDF)存档于2011-06-29）. 引用错误：带有name属性“Karp”的<ref>标签用不同内容定义了多次
Cook, Stephen. The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing. 1971: 151–158 [2011-07-20]. （原始内容存档于2020-08-06）.