Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121).
Anna GálMichal KouckýOded RegevRüdiger ReischukPublished in: Dagstuhl Reports (2014)
Keyphrases
- computational complexity
- np complete
- decision problems
- solving problems
- problems involving
- related problems
- database
- computational geometry
- optimization problems
- continuous optimization
- high computational complexity
- finite number
- benchmark problems
- computational efficiency
- multi class
- motion estimation
- scheduling problem
- special case
- search engine
- artificial intelligence
- real world
- neural network
- data sets