On Lovász’ lattice reduction and the nearest lattice point problem
Copyright policy )On Lovász’ lattice reduction and the nearest lattice point problem
This is the full version of the author's paper announced in Lect. Notes Comput. Sci. 182, 13-20 (1985; Zbl 0569.10015).
- University of Chicago United States
- Eötvös Loránd University Hungary
polynomial time, Analysis of algorithms and problem complexity, Integer programming, nonhomogeneous, Diophantine approximation, transcendental number theory, programming algorithm, computational number theory, simultaneous diophantine approximation, Lattices and convex bodies (number-theoretic aspects), Grötschel-Lowasz-Schrijver version, Quadratic forms (reduction theory, extreme forms, etc.), Lenstra's integer linear, Lovasz-reduced basis
polynomial time, Analysis of algorithms and problem complexity, Integer programming, nonhomogeneous, Diophantine approximation, transcendental number theory, programming algorithm, computational number theory, simultaneous diophantine approximation, Lattices and convex bodies (number-theoretic aspects), Grötschel-Lowasz-Schrijver version, Quadratic forms (reduction theory, extreme forms, etc.), Lenstra's integer linear, Lovasz-reduced basis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).589 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 0.1% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 0.1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!