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.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
