A Lower Bound on the Complexity of Testing Grained Distributions.
Oded GoldreichDana RonPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- lower bound
- average case complexity
- worst case
- upper bound
- fine grained
- probability distribution
- branch and bound
- branch and bound algorithm
- np hard
- computational complexity
- average case
- objective function
- random variables
- normal distribution
- lower and upper bounds
- lower bounding
- test cases
- upper and lower bounds
- complexity analysis
- scheduling problem
- hidden markov models
- optimal solution