Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391).
Aicke HinrichsJoseph F. TraubHenryk WozniakowskiLarisa YaroslavtsevaPublished in: Dagstuhl Reports (2015)
Keyphrases
- optimization problems
- computational issues
- space complexity
- learning algorithm
- difficult problems
- test problems
- combinatorial optimization
- computational complexity
- np hard problems
- benchmark problems
- significant improvement
- theoretical analysis
- computational cost
- worst case
- practical problems
- approximate solutions
- problems in computer vision
- polynomial time complexity
- decision problems
- run times
- hard problems
- greedy algorithms
- computational geometry
- high computational complexity
- computationally efficient
- search methods
- times faster
- exact algorithms
- complexity analysis
- lower complexity
- complexity bounds
- lower bound
- orders of magnitude