The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice.
Miklós AjtaiPublished in: STOC (2003)
Keyphrases
- worst case
- np hard
- average case
- cost function
- computational complexity
- detection algorithm
- preprocessing
- experimental evaluation
- learning algorithm
- space complexity
- optimization algorithm
- probabilistic model
- upper bound
- dynamic programming
- k means
- computational cost
- high accuracy
- edge detection
- linear programming
- computationally efficient
- theoretical analysis
- lower bound
- tree structure
- feature extraction
- data sets