Pages that link to "Item:Q2989711"
From MaRDI portal
The following pages link to A Deterministic Reduction for the Gap Minimum Distance Problem (Q2989711):
Displaying 10 items.
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Counting polynomials with distinct zeros in finite fields (Q503699) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Subset sums over Galois rings (Q2322901) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892431) (← links)
- Subset sums over Galois rings. II (Q6166733) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
