scientific article; zbMATH DE number 3908520
zbMATH Open0569.10015MaRDI QIDQ3686780FDOQ3686780
Authors: László Babai 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
polynomial timecomputational number theoryGrötschel-Lovász-Schrijver versionLenstra's integer linear programming algorithmLovász-reduced basisnonhomogeneous simultaneous diophantine approximation
Integer programming (90C10) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Algorithms in computer science (68W99)
Cited In (22)
- Improvements in closest point search based on dual HKZ-bases
- On the security of OSIDH
- The Generalized Basis Reduction Algorithm
- Efficient algorithms for discrete lattice calculations
- Trapdoors for ideal lattices with applications
- Reductions between short vector problems and simultaneous approximation
- An efficient algorithm for clustered integer least squares problems.
- On the asymptotic complexity of solving LWE
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Note on shortest and nearest lattice vectors
- Nearest lattice point algorithms on semi \(k\)-reduced basis
- On the probability of generating a primitive matrix
- On finite-precision representations of geometric objects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding well approximating lattices for a finite set of points
- Title not available (Why is that?)
- Block Reduced Lattice Bases and Successive Minima
- Closest point search in lattices
- An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686780)
