Hardness of approximating the closest vector problem with pre-processing (Q430834): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-011-0031-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034056530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the closest vector problem with pre-processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of decoding linear codes with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / 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: The inapproximability of lattice and coding problems with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices and factorization of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Distance Decoding for General Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of the closest vector problem with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / 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: Improved Inapproximability of Lattice and Coding Problems With Preprocessing / 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: Expander codes / rank
 
Normal rank

Latest revision as of 10:20, 5 July 2024

scientific article
Language Label Description Also known as
English
Hardness of approximating the closest vector problem with pre-processing
scientific article

    Statements

    Hardness of approximating the closest vector problem with pre-processing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    lattices
    0 references
    codes
    0 references
    approximation
    0 references
    hardness
    0 references
    preprocessing
    0 references
    0 references