Unique Shortest Vector Problem for max norm is NP-hard.
Thân Quang KhoátNguyen Hong TanPublished in: IACR Cryptol. ePrint Arch. (2008)
Keyphrases
- np hard
- shortest common supersequence
- linear programming
- greedy heuristic
- scheduling problem
- databases
- np complete
- worst case
- lower bound
- feature vectors
- optimal solution
- integer programming
- approximation algorithms
- branch and bound algorithm
- np hardness
- special case
- vector space
- closely related
- shortest path
- minimum cost
- path length
- linear program
- constraint satisfaction problems
- multivariate time series
- information systems
- markov random field
- set cover
- data sets