Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482).
Holger DellMark Richard JerrumHaiko MüllerKonrad AnandMarcus PappikPublished in: Dagstuhl Reports (2022)
Keyphrases
- computational complexity
- worst case
- data structure
- computational cost
- learning algorithm
- monte carlo
- computationally efficient
- optimization problems
- high dimensional
- face recognition
- lower bound
- objective function
- feature selection
- machine learning algorithms
- benchmark datasets
- orders of magnitude
- neural network
- computational efficiency
- times faster
- space complexity
- lower complexity
- computational issues