Home > Term: distributional complexity
distributional complexity
The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs.
- Ordklass: noun
- Bransch/domän: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Skapad av
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
