A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692): 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/s11432-013-4795-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996002292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / 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: Improved Inapproximability of Lattice and Coding Problems With Preprocessing / 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: Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard / 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: Lattice problems and norm embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice problems in NP ∩ coNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the hardness of lattice problems in \(\ell_{p}\) norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank

Latest revision as of 03:21, 11 July 2024

scientific article
Language Label Description Also known as
English
A polynomial time algorithm for GapCVPP in \(l_1\) norm
scientific article

    Statements

    A polynomial time algorithm for GapCVPP in \(l_1\) norm (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2015
    0 references
    lattices
    0 references
    algorithm
    0 references
    Laplace measures
    0 references
    closest vector problem with preprocessing
    0 references
    computational complexity
    0 references

    Identifiers

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