Sign In

Login

Password

Forgot Password ? Sign Up

Average-case complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Average-case complexity" in English language version.

refsWebsite
Global rank English rank
10doi.org
2nd place
2nd place
8worldcat.org
5th place
5th place
3siam.org
low place
6,473rd place
2springer.com
274th place
309th place
1nowpublishers.com
low place
low place
1uml.edu
low place
low place
1acm.org
1,185th place
840th place

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

doi.org (Global: 2nd place; English: 2nd place)

  • Goldreich, Oded; Vadhan, Salil (December 2007). "Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword". Computational Complexity. 16 (4): 325–330. doi:10.1007/s00037-007-0232-y. ISSN 1016-3328.
  • Bogdanov, Andrej; Trevisan, Luca (2006). "Average-Case Complexity". Foundations and Trends in Theoretical Computer Science. 2 (1): 1–106. doi:10.1561/0400000004. ISSN 1551-305X.
  • Levin, Leonid A. (February 1986). "Average Case Complete Problems". SIAM Journal on Computing. 15 (1): 285–286. doi:10.1137/0215020. ISSN 0097-5397.
  • Gurevich, Yuri (October 1987). "Complete and incomplete randomized NP problems". 28th Annual Symposium on Foundations of Computer Science (SFCS 1987). pp. 111–117. doi:10.1109/SFCS.1987.14. ISBN 0-8186-0807-2.
  • Livne, Noam (December 2010). "All Natural NP-Complete Problems Have Average-Case Complete Versions". Computational Complexity. 19 (4): 477–499. doi:10.1007/s00037-010-0298-9. ISSN 1016-3328.
  • Goldreich, Oded (2011), Goldreich, Oded (ed.), "Notes on Levin's Theory of Average-Case Complexity", Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Lecture Notes in Computer Science, vol. 6650, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 233–247, doi:10.1007/978-3-642-22670-0_21, ISBN 978-3-642-22669-4, retrieved 2025-05-21
  • Yao, Andrew (1977), "Probabilistic computations: Toward a unified measure of complexity", Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227, doi:10.1109/SFCS.1977.24
  • Ben-David, S.; Chor, B.; Goldreich, O. (1989). "On the theory of average case complexity". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. ACM Press. pp. 204–216. doi:10.1145/73007.73027. ISBN 978-0-89791-307-2.
  • Feigenbaum, Joan; Fortnow, Lance (October 1993). "Random-Self-Reducibility of Complete Sets". SIAM Journal on Computing. 22 (5): 994–1005. doi:10.1137/0222061. ISSN 0097-5397.
  • Bogdanov, Andrej; Trevisan, Luca (January 2006). "On Worst-Case to Average-Case Reductions for NP Problems". SIAM Journal on Computing. 36 (4): 1119–1159. doi:10.1137/S0097539705446974. ISSN 0097-5397.

nowpublishers.com (Global: low place; English: low place)

siam.org (Global: low place; English: 6,473rd place)

epubs.siam.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

uml.edu (Global: low place; English: low place)

cs.uml.edu

  • Wang, Jie (1997). "Average-case computational complexity theory". In Hemaspaandra, Lane A.; Selman, Alan L. (eds.). Complexity Theory: Retrospective II (PDF). Vol. 2. Springer Science & Business Media. pp. 295–328.

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

  • Goldreich, Oded; Vadhan, Salil (December 2007). "Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword". Computational Complexity. 16 (4): 325–330. doi:10.1007/s00037-007-0232-y. ISSN 1016-3328.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-03384-8. OCLC 311310321.
  • Bogdanov, Andrej; Trevisan, Luca (2006). "Average-Case Complexity". Foundations and Trends in Theoretical Computer Science. 2 (1): 1–106. doi:10.1561/0400000004. ISSN 1551-305X.
  • Levin, Leonid A. (February 1986). "Average Case Complete Problems". SIAM Journal on Computing. 15 (1): 285–286. doi:10.1137/0215020. ISSN 0097-5397.
  • Livne, Noam (December 2010). "All Natural NP-Complete Problems Have Average-Case Complete Versions". Computational Complexity. 19 (4): 477–499. doi:10.1007/s00037-010-0298-9. ISSN 1016-3328.
  • Feigenbaum, Joan; Fortnow, Lance (October 1993). "Random-Self-Reducibility of Complete Sets". SIAM Journal on Computing. 22 (5): 994–1005. doi:10.1137/0222061. ISSN 0097-5397.
  • Bogdanov, Andrej; Trevisan, Luca (January 2006). "On Worst-Case to Average-Case Reductions for NP Problems". SIAM Journal on Computing. 36 (4): 1119–1159. doi:10.1137/S0097539705446974. ISSN 0097-5397.

worldcat.org