Approximate CVP in time $2^{0.802 n}$ -- now in any norm! (Q2164729): Difference between revisions

@@ Property / OpenAlex ID @@
+W3203598337
@@ Property / OpenAlex ID: W3203598337 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02387
@@ Property / arXiv ID: 2110.02387 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Shortest Vector Problem in 2             <sup>n</sup>             Time Using Discrete Gaussian Sampling
+Normal rank
@@ Property / cites work @@
+Q5091027
@@ Property / cites work: Q5091027 / rank @@
+Normal rank
@@ Property / cites work @@
+(Gap/S)ETH hardness of SVP
@@ Property / cites work: (Gap/S)ETH hardness of SVP / rank @@
+Normal rank
@@ Property / cites work @@
+Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
+Normal rank
@@ Property / cites work @@
+Lattice problems in NP ∩ coNP
@@ Property / cites work: Lattice problems in NP ∩ coNP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228459
@@ Property / cites work: Q4228459 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542515
@@ Property / cites work: Q4542515 / rank @@
+Normal rank
@@ Property / cites work @@
+A sieve algorithm for the shortest lattice vector problem
+Normal rank
@@ Property / cites work @@
+Efficient checking of polynomials and proofs and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+On Lovász' lattice reduction and the nearest lattice point problem
+Normal rank
@@ Property / cites work @@
+Sampling methods for shortest vectors, closest vectors and successive minima
+Normal rank
@@ Property / cites work @@
+A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
+Normal rank
@@ Property / cites work @@
+Q5741633
@@ Property / cites work: Q5741633 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
+Normal rank
@@ Property / cites work @@
+Approximating CVP to within almost-polynomial factors is NP-hard
+Normal rank
@@ Property / cites work @@
+Covering cubes and the closest vector problem
@@ Property / cites work: Covering cubes and the closest vector problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate CVP\(_p\) in time \(2^{0.802n}\)
@@ Property / cites work: Approximate CVP\(_p\) in time \(2^{0.802n}\) / rank @@
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
+Normal rank
@@ Property / cites work @@
+On the limits of nonapproximability of lattice problems
+Normal rank
@@ Property / cites work @@
+Q3549646
@@ Property / cites work: Q3549646 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5791470
@@ Property / cites work: Q5791470 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194048
@@ Property / cites work: Q4194048 / rank @@
+Normal rank
@@ Property / cites work @@
+Minkowski's Convex Body Theorem and Integer Programming
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the shortest vector problem in lattices
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
+Normal rank
@@ Property / cites work @@
+A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
+Normal rank
@@ Property / cites work @@
+Q5417723
@@ Property / cites work: Q5417723 / rank @@
+Normal rank
@@ Property / cites work @@
+On some covering problems in geometry
@@ Property / cites work: On some covering problems in geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Covering convex bodies and the closest vector problem
+Normal rank
@@ Property / cites work @@
+Q3360789
@@ Property / cites work: Q3360789 / rank @@
+Normal rank
@@ Property / cites work @@
+Limits on the hardness of lattice problems in \(\ell_{p}\) norms
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Lattice problems and norm embeddings
@@ Property / cites work: Lattice problems and norm embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy of polynomial time lattice basis reduction algorithms
+Normal rank
@@ Property / cites work @@
+Discrete Gaussian Sampling Reduces to CVP and SVP
@@ Property / cites work: Discrete Gaussian Sampling Reduces to CVP and SVP / rank @@
+Normal rank

Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729): Difference between revisions

Latest revision as of 22:21, 29 July 2024

Statements

Sitelinks

Mathematics(1 entry)