Definitions from Wikipedia (Average-case complexity)

▸ noun:  In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs.


▸ Words similar to average-case complexity
▸ Usage examples for average-case complexity

▸ Idioms related to average-case complexity
▸ Wikipedia articles (New!)
▸ Words that often appear near average-case complexity
▸ Rhymes of average-case complexity

▸ Invented words related to average-case complexity