Hardness of approximating the closest vector problem with pre-processing (Q430834): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+H06
@@ Property / Mathematics Subject Classification ID: 11H06 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Y16
@@ Property / Mathematics Subject Classification ID: 11Y16 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6050358
@@ Property / zbMATH DE Number: 6050358 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lattices
@@ Property / zbMATH Keywords: lattices / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+codes
@@ Property / zbMATH Keywords: codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation
@@ Property / zbMATH Keywords: approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hardness
@@ Property / zbMATH Keywords: hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+preprocessing
@@ Property / zbMATH Keywords: preprocessing / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00037-011-0031-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2034056530
@@ Property / OpenAlex ID: W2034056530 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228459
@@ Property / cites work: Q4228459 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the closest vector problem with pre-processing
+Normal rank
@@ Property / cites work @@
+The hardness of decoding linear codes with preprocessing
+Normal rank
@@ Property / cites work @@
+A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
+Normal rank
@@ Property / cites work @@
+Approximating CVP to within almost-polynomial factors is NP-hard
+Normal rank
@@ Property / cites work @@
+The inapproximability of lattice and coding problems with preprocessing
+Normal rank
@@ Property / cites work @@
+Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
+Normal rank
@@ Property / cites work @@
+Solving low-density subset sum problems
@@ Property / cites work: Solving low-density subset sum problems / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Lattices and factorization of polynomials
@@ Property / cites work: Lattices and factorization of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+On Bounded Distance Decoding for General Lattices
@@ Property / cites work: On Bounded Distance Decoding for General Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+The hardness of the closest vector problem with preprocessing
+Normal rank
@@ Property / cites work @@
+Q4829810
@@ Property / cites work: Q4829810 / rank @@
+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 @@
+Improved Inapproximability of Lattice and Coding Problems With Preprocessing
+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 @@
+Expander codes
@@ Property / cites work: Expander codes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:430834