Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling.
Divesh AggarwalDaniel DadushOded RegevNoah Stephens-DavidowitzPublished in: CoRR (2014)
Keyphrases
- maximum likelihood
- discrete version
- sequence prediction
- shortest path
- combinatorial optimization
- parameter space
- finite number
- discrete valued
- discrete geometry
- continuous domains
- neural network
- random sampling
- continuous variables
- vector space
- gaussian filter
- sampled data
- discrete variables
- image restoration
- continuous valued
- evolutionary algorithm
- feature vectors
- objective function