Pages that link to "Item:Q1577010"
From MaRDI portal
The following pages link to On the limits of nonapproximability of lattice problems (Q1577010):
Displayed 6 items.
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)