Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.12.045 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070971235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing short linearly independent vectors and short bases in a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of nonapproximability of lattice problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the shortest vector problem in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice problems and norm embeddings / 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: Block Reduced Lattice Bases and Successive Minima / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.12.045 / rank
 
Normal rank

Latest revision as of 12:55, 10 December 2024

scientific article
Language Label Description Also known as
English
Sampling methods for shortest vectors, closest vectors and successive minima
scientific article

    Statements

    Sampling methods for shortest vectors, closest vectors and successive minima (English)
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    geometry of numbers
    0 references
    lattices
    0 references
    shortest vectors
    0 references

    Identifiers