On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm.
Léo DucasMaxime PlançonBenjamin WesolowskiPublished in: CRYPTO (1) (2019)
Keyphrases
- linear programming
- np hard
- dynamic programming
- optimal solution
- objective function
- theoretical analysis
- computational cost
- computational complexity
- experimental evaluation
- convergence rate
- data sets
- vector space
- matching algorithm
- optimization algorithm
- input data
- simulated annealing
- probabilistic model
- significant improvement
- k means
- search space
- data structure
- similarity measure
- image sequences
- learning algorithm