The following pages link to Lattice problems in NP ∩ coNP (Q3546284):
Displaying 32 items.
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← 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)
- On a certain class of positive definite functions and measures on locally compact abelian groups and inner-product spaces (Q2243155) (← links)
- Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Progress in quantum algorithms (Q2386407) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Measure inequalities and the transference theorem in the geometry of numbers (Q2862169) (← links)
- The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Discrete Gaussian Distributions via Theta Functions (Q4634347) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← 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)
- Constrained inhomogeneous spherical equations: average-case hardness (Q6601473) (← links)
- Provable dual attacks on learning with errors (Q6637724) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
