Pages that link to "Item:Q5172695"

The following pages link to A deterministic reduction for the gap minimum distance problem (Q5172695):

Displaying 9 items.

• A new sieve for distinct coordinate counting (Q625832) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• A Deterministic Reduction for the Gap Minimum Distance Problem (Q2989711) (← links)
• Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
• Hardness of approximating the minimum distance of a linear code (Q4679877) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• Worst-case to average case reductions for the distance to a code (Q5121912) (← links)
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892431) (← links)
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)