Complexidade de tempo (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complexidade de tempo" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

2^nd place

4^th place

5^th place

741^st place

748^th place

69^th place

195^th place

274^th place

339^th place

arxiv.org

Oded Regev (2004). «A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space». arXiv:quant-ph/0406151v1 [quant-ph]

Babai, László; Fortnow, Lance; Nisan, N.; Wigderson, Avi (1993). «BPP has subexponential time simulations unless EXPTIME has publishable proofs». Berlin, New York: Springer-Verlag. Computational Complexity. 3 (4): 307–318. doi:10.1007/BF01275486
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

Kumar, Ravi; Rubinfeld, Ronitt (2003). «Sublinear time algorithms» (PDF). SIGACT News. 34 (4): 57–67

Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. [S.l.]: Springer. p. 417. ISBN 978-3-540-29952-3. Consultado em 5 de março de 2010

Moser, P. (2003). «Baire's Categories on Small Complexity Classes». Berlin, New York: Springer-Verlag. Lecture Notes in Computer Science: 333–342. ISSN 0302-9743
Kuperberg, Greg (2005). «A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem». Philadelphia: Society for Industrial and Applied Mathematics. SIAM Journal on Computing. 35 (1): 188. ISSN 1095-7111