Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4228459 / 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 the complexity of computing short linearly independent vectors and short bases in a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / 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: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / 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: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579369 / 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: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank

Latest revision as of 10:18, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
scientific article

    Statements

    Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (English)
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    0 references