-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.
Divesh AggarwalZeyong LiNoah Stephens-DavidowitzPublished in: CoRR (2020)
Keyphrases
- detection algorithm
- dynamic programming
- np hard
- similarity measure
- computational complexity
- times faster
- computational cost
- simulated annealing
- worst case
- polygonal approximation
- recognition algorithm
- convergence rate
- matching algorithm
- optimization algorithm
- expectation maximization
- cost function
- k means
- preprocessing
- objective function
- computationally efficient
- genetic algorithm
- experimental evaluation
- error bounds
- optimal solution
- approximation ratio