Pages that link to "Item:Q4542514"
From MaRDI portal
The following pages link to On the limits of non-approximability of lattice problems (Q4542514):
Displaying 22 items.
- More on average case vs approximation complexity (Q430823) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- New (and old) proof systems for lattice problems (Q1753870) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Extension of Hoshen-Kopelman algorithm to non-lattice environments (Q1867874) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Inapproximability Results for Computational Problems on Lattices (Q5188550) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Public-key encryption from homogeneous CLWE (Q6169421) (← links)
