Pages that link to "Item:Q1577010"

The following pages link to On the limits of nonapproximability of lattice problems (Q1577010):

Displaying 33 items.

• Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
• On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
• On the asymptotic complexity of solving LWE (Q1692148) (← links)
• New (and old) proof systems for lattice problems (Q1753870) (← links)
• Extension of Hoshen-Kopelman algorithm to non-lattice environments (Q1867874) (← links)
• Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613) (← links)
• Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
• Improved hardness results for unique shortest vector problem (Q2629774) (← links)
• Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
• Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
• Complexity of lattice problems. Non-approximability and limits of non-approximability (Q2922519) (← links)
• The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
• Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
• Lattice problems in NP ∩ coNP (Q3546284) (← links)
• On the limits of non-approximability of lattice problems (Q4542514) (← links)
• Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
• (Q5092454) (← links)
• Inapproximability Results for Computational Problems on Lattices (Q5188550) (← 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)
• Classical reduction of gap SVP to LWE: a concrete security analysis (Q6112249) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
• Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
• Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
• Constrained inhomogeneous spherical equations: average-case hardness (Q6601473) (← links)