On Lovász’ lattice reduction and the nearest lattice point problem

This publication has 10 references indexed in Scilit:

• An algorithm to construct Minkowski-reduced lattice-bases
  Published by Springer Nature ,2005
• Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
  Published by Association for Computing Machinery (ACM) ,1984
• Geometric Methods in Combinatorial Optimization
  Published by Elsevier ,1984
• Integer Programming with a Fixed Number of Variables
  Mathematics of Operations Research, 1983
• Solving low density subset sum problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Improved algorithms for integer programming and related lattice problems
  Published by Association for Computing Machinery (ACM) ,1983
• On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
  Published by Springer Nature ,1983
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982
• A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981