Talk:Probabilistic analysis of algorithms
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
It is of interest to the following WikiProjects:
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low This article has been rated as Low-priority on the project's priority scale.
WikiProject icon This article is within the scope of WikiProject Computing , a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
??? This article has not yet received a rating on the project's importance scale.
|auto= parameter.Average != expected
[edit ]Average complexity does NOT mean expected complexity. While the latter is well defined (assuming a predefined randomness distribution) average-case complexity is much more subtle. For example, in cryptography an algorithm has average exponential-time complexity if the number of problems that can be solved in polynomial time is negligible. It is not too hard to construct counter-examples where the expected complexity may be polynomial or exponential. Nageh (talk) 18:16, 4 March 2011 (UTC) [reply ]