An improved lower bound for approximating the minimum integral solution problem with preprocessing over $\ell_\infty$ norm (Q498420): Difference between revisions

@@ 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/s10878-013-9646-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1980968159
@@ Property / OpenAlex ID: W1980968159 / 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 @@
+An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Approximate solution of NP optimization problems
@@ Property / cites work: Approximate solution of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient probabilistically checkable proofs and applications to approximations
+Normal rank
@@ Property / cites work @@
+Q3726125
@@ Property / cites work: Q3726125 / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of decoding linear codes with preprocessing
+Normal rank
@@ Property / cites work @@
+Inapproximability results for the minimum integral solution problem with preprocessing over \(\ell_{\infty}\) norm
+Normal rank
@@ Property / cites work @@
+The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm
+Normal rank
@@ Property / cites work @@
+Q4503941
@@ Property / cites work: Q4503941 / rank @@
+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 @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of solving subset sum with preprocessing
+Normal rank
@@ Property / cites work @@
+The hardness of the closest vector problem with preprocessing
+Normal rank
@@ Property / cites work @@
+Lattice problems and norm embeddings
@@ Property / cites work: Lattice problems and norm embeddings / rank @@
+Normal rank

An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420): Difference between revisions

Latest revision as of 19:31, 10 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)