04401 Summary - Algorithms and Complexity for Continuous Problems.
Thomas Müller-GronbachErich NovakKnut PetrasJoseph F. TraubPublished in: Algorithms and Complexity for Continuous Problems (2004)
Keyphrases
- computational complexity
- worst case
- computationally efficient
- practical problems
- optimization problems
- learning algorithm
- benchmark problems
- combinatorial optimization
- search methods
- related problems
- difficult problems
- significant improvement
- hard problems
- lower complexity
- specific problems
- high computational complexity
- computationally hard
- computational issues
- problems in computer vision
- approximate solutions
- space complexity
- test problems
- decision problems
- orders of magnitude
- data structure
- data sets
- exact algorithms
- exact and approximate
- computational cost
- multi objective
- complexity bounds
- reduced complexity
- np hard problems
- objective function
- numeric values