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

@@ Property / arXiv ID @@
+.1481
@@ Property / arXiv ID: 1010.1481 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542515
@@ Property / cites work: Q4542515 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
+Normal rank
@@ Property / cites work @@
+Pseudorandom Bits for Polynomials
@@ Property / cites work: Pseudorandom Bits for Polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
+Normal rank
@@ Property / cites work @@
+Complexity of Decoding Positive-Rate Reed-Solomon Codes
+Normal rank
@@ Property / cites work @@
+A deterministic reduction for the gap minimum distance problem
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the minimum distance of a linear code
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+Q3549646
@@ Property / cites work: Q3549646 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002801
@@ Property / cites work: Q3002801 / rank @@
+Normal rank
@@ Property / cites work @@
+The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
+Normal rank
@@ Property / cites work @@
+The intractability of computing the minimum distance of a code
+Normal rank
@@ Property / cites work @@
+The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
+Normal rank