Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331).
Thore HusfeldtRamamohan PaturiGregory B. SorkinRyan WilliamsPublished in: Dagstuhl Reports (2013)
Keyphrases
- learning algorithm
- worst case
- computational cost
- computer vision
- significant improvement
- high computational complexity
- data structure
- data mining algorithms
- computationally efficient
- lower complexity
- database
- average case
- recently developed
- orders of magnitude
- theoretical analysis
- optimization problems
- scheduling problem
- special case
- database systems
- neural network