Computational complexity theory (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Computational complexity theory" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

4web.archive.org

1^st place

3psu.edu

207^th place

136^th place

3books.google.com

3^rd place

2claymath.org

8,402^nd place

8,241^st place

2princeton.edu

741^st place

577^th place

2semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1zbmath.org

1,923^rd place

1,068^th place

1nih.gov

4^th place

1ams.org

451^st place

277^th place

1fortnow.com

low place

1wolfram.com

513^th place

537^th place

1harvard.edu

18^th place

17^th place

1uchicago.edu

230^th place

214^th place

1clemson.edu

5,952^nd place

3,809^th place

1berkeley.edu

580^th place

462^nd place

ams.org

Jaffe, Arthur M. (2006), "The Millennium Grand Challenge in Mathematics" (PDF), Notices of the AMS, 53 (6), archived (PDF) from the original on June 12, 2006, retrieved October 18, 2006.

arxiv.org

Babai, László (2016). "Graph Isomorphism in Quasipolynomial Time". arXiv:1512.03547 [cs.DS].
Babai, László; Campagnolo, Manuel (2009). "A Survey on Continuous Time Computations". arXiv:0907.3117 [cs.CC].

berkeley.edu

cs.berkeley.edu

Richard M. Karp (1972), "Reducibility Among Combinatorial Problems" (PDF), in R. E. Miller; J. W. Thatcher (eds.), Complexity of Computer Computations, New York: Plenum, pp. 85–103, archived from the original (PDF) on June 29, 2011, retrieved September 28, 2009

books.google.com

Meurant, Gerard (2014). Algorithms and Complexity. Elsevier. p. p. 4. ISBN 978-0-08093391-7.
Zobel, Justin (2015). Writing for Computer Science. Springer. p. 132. ISBN 978-1-44716639-9.
Boris Trakhtenbrot, "From Logic to Theoretical Computer Science – An Update". In: Pillars of Computer Science, LNCS 4800, Springer 2008.

claymath.org

"P vs NP Problem | Clay Mathematics Institute". www.claymath.org. Archived from the original on July 6, 2018. Retrieved July 6, 2018.
Cook, Stephen (April 2000), The P versus NP Problem (PDF), Clay Mathematics Institute, archived from the original (PDF) on December 12, 2010, retrieved October 18, 2006.

clemson.edu

cecas.clemson.edu

Richard M. Karp, "Combinatorics, Complexity, and Randomness", 1985 Turing Award Lecture

doi.org

Ladner, Richard E. (1975), "On the structure of polynomial time reducibility", Journal of the ACM, 22 (1): 151–171, doi:10.1145/321864.321877, S2CID 14352974.
Berger, Bonnie A.; Leighton, T (1998), "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete", Journal of Computational Biology, 5 (1): 27–40, CiteSeerX 10.1.1.139.5547, doi:10.1089/cmb.1998.5.27, PMID 9541869.
Arvind, Vikraman; Kurur, Piyush P. (2006), "Graph isomorphism is in SPP", Information and Computation, 204 (5): 835–852, doi:10.1016/j.ic.2006.02.002.
Schöning, Uwe (1988), "Graph Isomorphism is in the Low Hierarchy", Journal of Computer and System Sciences, 37 (3): 312–323, doi:10.1016/0022-0000(88)90010-4
Smale, Steve (1997). "Complexity Theory and Numerical Analysis". Acta Numerica. 6. Cambridge Univ Press: 523–551. Bibcode:1997AcNum...6..523S. CiteSeerX 10.1.1.33.4678. doi:10.1017/s0962492900002774. S2CID 5949193.
Tomlin, Claire J.; Mitchell, Ian; Bayen, Alexandre M.; Oishi, Meeko (July 2003). "Computational Techniques for the Verification of Hybrid Systems". Proceedings of the IEEE. 91 (7): 986–1001. CiteSeerX 10.1.1.70.4296. doi:10.1109/jproc.2003.814621.
Yamada, H. (1962). "Real-Time Computation and Recursive Functions Not Real-Time Computable". IEEE Transactions on Electronic Computers. EC-11 (6): 753–760. doi:10.1109/TEC.1962.5219459.

fortnow.com

weblog.fortnow.com

Fortnow, Lance (September 13, 2002). "Computational Complexity Blog: Factoring". weblog.fortnow.com.

harvard.edu

ui.adsabs.harvard.edu

Smale, Steve (1997). "Complexity Theory and Numerical Analysis". Acta Numerica. 6. Cambridge Univ Press: 523–551. Bibcode:1997AcNum...6..523S. CiteSeerX 10.1.1.33.4678. doi:10.1017/s0962492900002774. S2CID 5949193.

nih.gov

pubmed.ncbi.nlm.nih.gov

Berger, Bonnie A.; Leighton, T (1998), "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete", Journal of Computational Biology, 5 (1): 27–40, CiteSeerX 10.1.1.139.5547, doi:10.1089/cmb.1998.5.27, PMID 9541869.

princeton.edu

cs.princeton.edu

See Arora & Barak 2009, Chapter 1: The computational model and why it doesn't matter Arora, Sanjeev; Barak, Boaz (2009), Computational Complexity: A Modern Approach, Cambridge University Press, ISBN 978-0-521-42426-4, Zbl 1193.68112
Boaz Barak's course on Computational Complexity Lecture 2

psu.edu

citeseerx.ist.psu.edu

Berger, Bonnie A.; Leighton, T (1998), "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete", Journal of Computational Biology, 5 (1): 27–40, CiteSeerX 10.1.1.139.5547, doi:10.1089/cmb.1998.5.27, PMID 9541869.
Smale, Steve (1997). "Complexity Theory and Numerical Analysis". Acta Numerica. 6. Cambridge Univ Press: 523–551. Bibcode:1997AcNum...6..523S. CiteSeerX 10.1.1.33.4678. doi:10.1017/s0962492900002774. S2CID 5949193.
Tomlin, Claire J.; Mitchell, Ian; Bayen, Alexandre M.; Oishi, Meeko (July 2003). "Computational Techniques for the Verification of Hybrid Systems". Proceedings of the IEEE. 91 (7): 986–1001. CiteSeerX 10.1.1.70.4296. doi:10.1109/jproc.2003.814621.

semanticscholar.org

api.semanticscholar.org

Ladner, Richard E. (1975), "On the structure of polynomial time reducibility", Journal of the ACM, 22 (1): 151–171, doi:10.1145/321864.321877, S2CID 14352974.
Smale, Steve (1997). "Complexity Theory and Numerical Analysis". Acta Numerica. 6. Cambridge Univ Press: 523–551. Bibcode:1997AcNum...6..523S. CiteSeerX 10.1.1.33.4678. doi:10.1017/s0962492900002774. S2CID 5949193.

uchicago.edu

people.cs.uchicago.edu

Fortnow & Homer (2003) Fortnow, Lance; Homer, Steven (2003), "A Short History of Computational Complexity" (PDF), Bulletin of the EATCS, 80: 95–133

web.archive.org

"P vs NP Problem | Clay Mathematics Institute". www.claymath.org. Archived from the original on July 6, 2018. Retrieved July 6, 2018.
Cook, Stephen (April 2000), The P versus NP Problem (PDF), Clay Mathematics Institute, archived from the original (PDF) on December 12, 2010, retrieved October 18, 2006.
Jaffe, Arthur M. (2006), "The Millennium Grand Challenge in Mathematics" (PDF), Notices of the AMS, 53 (6), archived (PDF) from the original on June 12, 2006, retrieved October 18, 2006.
Richard M. Karp (1972), "Reducibility Among Combinatorial Problems" (PDF), in R. E. Miller; J. W. Thatcher (eds.), Complexity of Computer Computations, New York: Plenum, pp. 85–103, archived from the original (PDF) on June 29, 2011, retrieved September 28, 2009

wolfram.com

mathworld.wolfram.com

Wolfram MathWorld: Number Field Sieve

zbmath.org

See Arora & Barak 2009, Chapter 1: The computational model and why it doesn't matter Arora, Sanjeev; Barak, Boaz (2009), Computational Complexity: A Modern Approach, Cambridge University Press, ISBN 978-0-521-42426-4, Zbl 1193.68112