Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.
Ronen ShaltielPublished in: Computational Complexity Conference (2009)
Keyphrases
- learning algorithm
- theoretical analysis
- real time
- case study
- data structure
- significant improvement
- worst case
- computationally efficient
- benchmark datasets
- information retrieval
- reinforcement learning
- computational complexity
- data mining techniques
- computationally expensive
- combinatorial optimization
- real valued data