Let L be a lattice. Let a' be a vector outside L. We know closest vector problem is an NP Hard Problem. But is there any approximation algorithm (like LLL algorithm to the shorest vector problem) by which we find the closer vector of L from a' using SAGE or Magma?
--~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
