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.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback