Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121).
Anna GálMeena MahajanRahul SanthanamTill TantauPublished in: Dagstuhl Reports (2021)
Keyphrases
- computational complexity
- np complete
- decision problems
- related problems
- problems involving
- data sets
- discrete variables
- expert systems
- optimization problems
- continuous optimization
- computational geometry
- high computational complexity
- solving problems
- computational cost
- high dimensional
- feature space
- search algorithm
- case study
- feature selection