A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149168689 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.1481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Decoding Positive-Rate Reed-Solomon Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic reduction for the gap minimum distance problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the minimum distance of a linear code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002801 / 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: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of \(D\) small-bias generators fools polynomials of degree \(D\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:51, 4 July 2024

scientific article; zbMATH DE number 5917985
Language Label Description Also known as
English
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
scientific article; zbMATH DE number 5917985

    Statements

    A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (English)
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references
    0 references