Complejidad temporal (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complejidad temporal" in Spanish language version.

refsWebsite

Global rank Spanish rank

11doi.org

2^nd place

3issn.org

57^th place

3^rd place

2uwaterloo.ca

3,153^rd place

6,860^th place

2arxiv.org

69^th place

148^th place

2princeton.edu

741^st place

1,126^th place

1dartmouth.edu

2,242^nd place

2,917^th place

1buffalo.edu

4,241^st place

5,423^rd place

1archive.org

6^th place

5^th place

1harvard.edu

18^th place

34^th place

1scottaaronson.com

low place

1web.archive.org

1^st place

1springer.com

274^th place

245^th place

archive.org

Papadimitriou, Christos H. (1994). Computational complexity. Reading, Mass.: Addison-Wesley. ISBN 0-201-53082-1.

arxiv.org

Kuperberg, Greg (2005). «A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem». SIAM Journal on Computing (Philadelphia) 35 (1): 188. ISSN 1095-7111. arXiv:quant-ph/0302112. doi:10.1137/s0097539703436345.
«A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space». arXiv:quant-ph/0406151v1. 2004.

buffalo.edu

cse.buffalo.edu

Naik, Ashish V.; Regan, Kenneth W.; Sivakumar, D. (1995). «On Quasilinear Time Complexity Theory». Theoretical Computer Science 148 (2): 325-349. doi:10.1016/0304-3975(95)00031-q. Consultado el 23 de febrero de 2015.

dartmouth.edu

math.dartmouth.edu

Lenstra, Jr., H.W.; Pomerance, Carl (11 de diciembre de 2016). Primality testing with Gaussian periods.

doi.org

dx.doi.org

Mehlhorn, Kurt; Naher, Stefan (1990). «Bounded ordered dictionaries in O(log log N) time and O(n) space». Information Processing Letters 35 (4): 183-189. doi:10.1016/0020-0190(90)90022-P.
Tao, Terence (2010). «1.11 The AKS primality test». An epsilon of room, II: Pages from year three of a mathematical blog. Graduate Studies in Mathematics 117. Providence, RI: American Mathematical Society. pp. 82-86. ISBN 978-0-8218-5280-4. doi:10.1090/gsm/117.
Bradford, Phillip G.; Rawlins, Gregory J. E.; Shannon, Gregory E. (1998). «Efficient Matrix Chain Ordering in Polylog Time». SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics) 27 (2): 466-490. ISSN 1095-7111. doi:10.1137/S0097539794270698.
Kumar, Ravi; Rubinfeld, Ronitt (2003). «Sublinear time algorithms». SIGACT News 34 (4): 57-67. doi:10.1145/954092.954103.
Naik, Ashish V.; Regan, Kenneth W.; Sivakumar, D. (1995). «On Quasilinear Time Complexity Theory». Theoretical Computer Science 148 (2): 325-349. doi:10.1016/0304-3975(95)00031-q. Consultado el 23 de febrero de 2015.
Impagliazzo, R.; Paturi, R. (2001). «On the complexity of k-SAT». Journal of Computer and System Sciences (Elsevier) 62 (2): 367-375. ISSN 1090-2724. doi:10.1006/jcss.2000.1727.
Babai, László; Fortnow, Lance; Nisan, N.; Wigderson, Avi (1993). «BPP has subexponential time simulations unless EXPTIME has publishable proofs». Computational Complexity (Berlin, New York: Springer-Verlag) 3 (4): 307-318. doi:10.1007/BF01275486.
Philippe Moser (2003). Baire’s Categories on Small Complexity Classes 2751. pp. 333-342. ISBN 978-3-540-40543-6. doi:10.1007/978-3-540-45077-1_31.
Miltersen, P.B. (2001). «Derandomizing Complexity Classes». Handbook of Randomized Computing. Combinatorial Optimization (Kluwer Academic Pub) 9: 843. ISBN 978-1-4613-4886-3. doi:10.1007/978-1-4615-0013-1_19.
Kuperberg, Greg (2005). «A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem». SIAM Journal on Computing (Philadelphia) 35 (1): 188. ISSN 1095-7111. arXiv:quant-ph/0302112. doi:10.1137/s0097539703436345.
Impagliazzo, R.; Paturi, R.; Zane, F. (2001). «Which problems have strongly exponential complexity?». Journal of Computer and System Sciences 63 (4): 512-530. doi:10.1006/jcss.2001.1774.

harvard.edu

adsabs.harvard.edu

Braverman, Mark; Ko, Young Kun; Rubinstein, Aviad; Weinstein, Omri (2015), ETH hardness for densest- $k$ -subgraph with perfect completeness, Bibcode:2015arXiv150408352B ..

issn.org

portal.issn.org

Bradford, Phillip G.; Rawlins, Gregory J. E.; Shannon, Gregory E. (1998). «Efficient Matrix Chain Ordering in Polylog Time». SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics) 27 (2): 466-490. ISSN 1095-7111. doi:10.1137/S0097539794270698.
Impagliazzo, R.; Paturi, R. (2001). «On the complexity of k-SAT». Journal of Computer and System Sciences (Elsevier) 62 (2): 367-375. ISSN 1090-2724. doi:10.1006/jcss.2000.1727.
Kuperberg, Greg (2005). «A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem». SIAM Journal on Computing (Philadelphia) 35 (1): 188. ISSN 1095-7111. arXiv:quant-ph/0302112. doi:10.1137/s0097539703436345.

princeton.edu

cs.princeton.edu

Kumar, Ravi; Rubinfeld, Ronitt (2003). «Sublinear time algorithms». SIGACT News 34 (4): 57-67. doi:10.1145/954092.954103.

algs4.cs.princeton.edu

Sedgewick, R. and Wayne K (2011). Algorithms, 4th Ed. p. 186. Pearson Education, Inc.

scottaaronson.com

Aaronson, Scott (5 de abril de 2009). «A not-quite-exponential dilemma». Shtetl-Optimized. Consultado el 2 de diciembre de 2009.

springer.com

Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. Springer. p. 417. ISBN 978-3-540-29952-3. Archivado desde el original el 18 de noviembre de 2007. Consultado el 14 de julio de 2020.

uwaterloo.ca

complexityzoo.uwaterloo.ca

Complexity Zoo: Class QP: Quasipolynomial-Time
Complexity Zoo: Class SUBEXP: Deterministic Subexponential-Time

web.archive.org

Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. Springer. p. 417. ISBN 978-3-540-29952-3. Archivado desde el original el 18 de noviembre de 2007. Consultado el 14 de julio de 2020.