Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation.
Ali ÇivrilPublished in: CoRR (2023)
Keyphrases
- computational complexity
- np complete
- linear computational complexity
- polynomial time approximation
- randomized approximation
- approximation schemes
- np hard
- low complexity
- worst case
- computationally efficient
- special case
- closed form
- polynomial approximation
- approximation algorithms
- motion estimation
- phase transition
- computational cost
- multiscale
- agnostic learning
- numerical scheme
- np hardness
- detection scheme
- learning scheme
- error bounds
- computational efficiency
- probabilistic model