bn:00756395n
Noun Concept
Categories: Randomized algorithms, Analysis of algorithms
EN
average-case complexity  average case complexity  Average case computational complexity  AvgP  distNP
EN
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource used by the algorithm, averaged over all possible inputs. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource used by the algorithm, averaged over all possible inputs. Wikipedia