On Lovász' lattice reduction and the nearest lattice point problem (Q1076512): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices and factorization of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of the Mertens conjecture. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of diophantine approximations. II (inhomogeneous problems) / rank
 
Normal rank

Revision as of 13:30, 17 June 2024

scientific article
Language Label Description Also known as
English
On Lovász' lattice reduction and the nearest lattice point problem
scientific article

    Statements

    On Lovász' lattice reduction and the nearest lattice point problem (English)
    0 references
    0 references
    1986
    0 references
    This is the full version of the author's paper announced in Lect. Notes Comput. Sci. 182, 13-20 (1985; Zbl 0569.10015).
    0 references
    computational number theory
    0 references
    Lovasz-reduced basis
    0 references
    nonhomogeneous
    0 references
    simultaneous diophantine approximation
    0 references
    Grötschel-Lowasz-Schrijver version
    0 references
    Lenstra's integer linear
    0 references
    programming algorithm
    0 references
    polynomial time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references