Solving shortest and closest vector problems: The decomposition approach.
Anja BeckerNicolas GamaAntoine JouxPublished in: IACR Cryptol. ePrint Arch. (2013)
Keyphrases
- solving problems
- constrained problems
- np complete
- combinatorial optimization
- algebraic equations
- solving complex
- timetabling problem
- convex quadratic programming
- sparse linear systems
- quadratic programming problems
- examination timetabling
- np complete problems
- constraint problems
- neural network
- combinatorial problems
- decision problems
- optimization problems
- search space
- data mining