From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem.
Yijia ChenJörg FlumPublished in: J. ACM (2012)
Keyphrases
- worst case
- computational complexity
- orders of magnitude
- significant improvement
- computational cost
- space complexity
- learning algorithm
- lower complexity
- dynamic programming
- theoretical analysis
- simulated annealing
- times faster
- computational efficiency
- benchmark datasets
- data structure
- machine learning
- upper bound
- inference rules
- scheduling problem
- optimality criterion
- approximately optimal