Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121).
Anna GálMichal KouckýOded RegevTill TantauPublished in: Dagstuhl Reports (2017)
Keyphrases
- computational complexity
- np complete
- related problems
- difficult problems
- np hard
- problems involving
- benchmark problems
- discrete geometry
- case study
- computational geometry
- continuous domains
- solving problems
- decision problems
- multi class
- probabilistic model
- computational cost
- special case
- evolutionary algorithm
- optimal solution
- multiscale