Pages that link to "Item:Q5892431"
From MaRDI portal
The following pages link to A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892431):
Displaying 6 items.
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- A Deterministic Reduction for the Gap Minimum Distance Problem (Q2989711) (← links)
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding (Q4630314) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
