In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the...

The worst-case analysis is related to the worst-case complexity. Many algorithms with bad worst-case performance have good average-case performance...

complexity of an algorithm should be contrasted with its average-case complexity, which is an average measure of the amount of resources the algorithm uses...

worst-case complexity is the maximum of the complexity over all inputs of size n, and the average-case complexity is the average of the complexity over...

following complexities: Best-case complexity: This is the complexity of solving the problem for the best input of size n. Average-case complexity: This is...

common types of complexity estimates are the average-case complexity and the almost-always complexity. To obtain the average-case complexity, given an input...

Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs". Generic-case...

Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes...

his work in randomness in computing, algorithmic complexity and intractability, average-case complexity, foundations of mathematics and computer science...

worst-case complexity. Average-case analysis was first introduced to overcome the limitations of worst-case analysis. However, the resulting average-case complexity...