scientific article; zbMATH DE number 7788447
From MaRDI portal
Publication:6147364
Cited in
(7)- Economical convex coverings and applications
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- Improved lower bounds for approximating parameterized nearest codeword and related problems under ETH
- Worst-case to average-case hardness of LWE: an alternative perspective
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147364)
