The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3144422206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / 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: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / 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: The complexity of the max word problem and the power of one-way interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / 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: Q4142699 / 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: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279529 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:51, 27 May 2024

scientific article
Language Label Description Also known as
English
The hardness of approximate optima in lattices, codes, and systems of linear equations
scientific article

    Statements

    The hardness of approximate optima in lattices, codes, and systems of linear equations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 1997
    0 references
    nearest lattice vector problem
    0 references
    nearest codeword problem
    0 references
    binary codes
    0 references

    Identifiers