时间复杂度 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "时间复杂度" in Chinese language version.

refsWebsite

Global rank Chinese rank

2^nd place

23^rd place

5^th place

12^th place

3web.archive.org

1^st place

1^st place

741^st place

907^th place

1scottaaronson.com

low place

low place

179^th place

275^th place

1,933^rd place

1,288^th place

451^st place

935^th place

69^th place

254^th place

ams.org

Impagliazzo, Russell; Paturi, Ramamohan. On the complexity of $k$ -SAT (PDF). Journal of Computer and System Sciences. 2001, 62 (2): 367–375 [2021-08-12]. MR 1820597. doi:10.1006/jcss.2000.1727 . （原始内容存档 (PDF)于2021-07-10）.

arxiv.org

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

doi.org

Mehlhorn, Kurt; Naher, Stefan. Bounded ordered dictionaries in O(log log N) time and O(n) space. Information Processing Letters. 1990, 35 (4): 183. doi:10.1016/0020-0190(90)90022-P.
Babai, László; Fortnow, Lance; Nisan, N.; Wigderson, Avi. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity (Berlin, New York: Springer-Verlag). 1993, 3 (4): 307–318. doi:10.1007/BF01275486.
Bradford, Phillip G.; Rawlins, Gregory J. E.; Shannon, Gregory E. Efficient Matrix Chain Ordering in Polylog Time. SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics). 1998, 27 (2): 466–490. ISSN 1095-7111. doi:10.1137/S0097539794270698.
Impagliazzo, Russell; Paturi, Ramamohan. On the complexity of $k$ -SAT (PDF). Journal of Computer and System Sciences. 2001, 62 (2): 367–375 [2021-08-12]. MR 1820597. doi:10.1006/jcss.2000.1727 . （原始内容存档 (PDF)于2021-07-10）.
Kuperberg, Greg. A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics). 2005, 35 (1): 188. ISSN 1095-7111. doi:10.1137/s0097539703436345.

princeton.edu

cs.princeton.edu

Kumar, Ravi; Rubinfeld, Ronitt. Sublinear time algorithms (PDF). SIGACT News. 2003, 34 (4): 57–67 [2013-05-01]. （原始内容存档 (PDF)于2016-03-03）.

scottaaronson.com

Aaronson, Scott. A not-quite-exponential dilemma. Shtetl-Optimized. 5 April 2009 [2 December 2009]. （原始内容存档于2019-05-25）.

stanford.edu

qwiki.stanford.edu

Complexity Zoo: Class SUBEXP: Deterministic Subexponential-Time

ucsd.edu

cseweb.ucsd.edu

Impagliazzo, Russell; Paturi, Ramamohan. On the complexity of $k$ -SAT (PDF). Journal of Computer and System Sciences. 2001, 62 (2): 367–375 [2021-08-12]. MR 1820597. doi:10.1006/jcss.2000.1727 . （原始内容存档 (PDF)于2021-07-10）.

web.archive.org

Kumar, Ravi; Rubinfeld, Ronitt. Sublinear time algorithms (PDF). SIGACT News. 2003, 34 (4): 57–67 [2013-05-01]. （原始内容存档 (PDF)于2016-03-03）.
Aaronson, Scott. A not-quite-exponential dilemma. Shtetl-Optimized. 5 April 2009 [2 December 2009]. （原始内容存档于2019-05-25）.
Impagliazzo, Russell; Paturi, Ramamohan. On the complexity of $k$ -SAT (PDF). Journal of Computer and System Sciences. 2001, 62 (2): 367–375 [2021-08-12]. MR 1820597. doi:10.1006/jcss.2000.1727 . （原始内容存档 (PDF)于2021-07-10）.

worldcat.org

Bradford, Phillip G.; Rawlins, Gregory J. E.; Shannon, Gregory E. Efficient Matrix Chain Ordering in Polylog Time. SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics). 1998, 27 (2): 466–490. ISSN 1095-7111. doi:10.1137/S0097539794270698.
Moser, P. Baire's Categories on Small Complexity Classes. Lecture Notes in Computer Science (Berlin, New York: Springer-Verlag). 2003: 333–342. ISSN 0302-9743.
Kuperberg, Greg. A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM Journal on Computing (Philadelphia: Society for Industrial and Applied Mathematics). 2005, 35 (1): 188. ISSN 1095-7111. doi:10.1137/s0097539703436345.