Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix.
Boleslaw K. SzymanskiBalaram SinharoyPublished in: Inf. Process. Lett. (1992)
Keyphrases
- sparse matrix
- lattice structure
- nearest neighbor
- rough approximations
- rows and columns
- vector data
- complexity analysis
- space complexity
- automatically generated
- matrix representation
- np hard
- computational complexity
- genetic algorithm
- symmetric matrices
- dot product
- lattice points
- symmetric matrix
- transformation matrix
- real time
- linear algebra
- generation process
- randomly selected
- decision problems
- least squares
- data points
- optimal solution
- similarity measure
- feature selection