Corrigenda: Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix.

Boleslaw K. Szymanski Balaram Sinharoy

Published in: Inf. Process. Lett. (1992)

Keyphrases

sparse matrix
computational cost
matrix representation
learning algorithm
clustering algorithm
computational complexity
worst case
sufficient conditions
decision problems
automatically generated
dot product
real time
lattice structure
markov chain
case study
neural network
data sets