Abstract
In this paper we introduce a new lattice problem, the subspace avoiding problem (SAP). We describe a probabilistic single exponential time algorithm for Sap for arbitrary lp norms. We also describe polynomial time reductions for four classical problems from the geometry of numbers, the shortest vector problem (SVP), the closest vector problem (CVP), the successive minima problem (SMP), and the shortest independent vectors problem (SIVP) to Sap, establishing probabilistic single exponential time algorithms for them. The result generalize and extend previous results of Ajtai, Kumar and Sivakumar. The results on Smp and Sivp are new for all norms. The results on Svp and Cvp generalize previous results of Ajtai et al. for the l2 norm to arbitrary lp norms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
