Pages that link to "Item:Q1356888"

The following pages link to The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888):

Displaying 50 items.

• Matrix sparsification and the sparse null space problem (Q329287) (← links)
• Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
• On generalizations of network design problems with degree bounds (Q378106) (← links)
• More on average case vs approximation complexity (Q430823) (← links)
• Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
• An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
• A code-based group signature scheme (Q510499) (← links)
• Approximation and hardness results for label cut and related problems (Q630189) (← links)
• Hardness results for homology localization (Q633215) (← links)
• Improved approximation algorithms for label cover problems (Q634686) (← links)
• The checkpoint problem (Q714790) (← links)
• The ordered covering problem (Q722532) (← links)
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206) (← links)
• Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
• Inapproximability results for equations over infinite groups (Q974745) (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
• A theory of learning with similarity functions (Q1009272) (← links)
• Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600) (← links)
• A note on the subadditive network design problem (Q1038103) (← links)
• On the hardness of approximating max-satisfy (Q1045886) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
• On the complexity of learning from drifting distributions (Q1376422) (← links)
• On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
• On the limits of nonapproximability of lattice problems (Q1577010) (← links)
• A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
• Hardness results for neural network approximation problems (Q1603592) (← links)
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
• On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints (Q1717231) (← links)
• A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
• Derandomized graph products (Q1842777) (← links)
• A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
• The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
• Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
• On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
• Goal scoring, coherent loss and applications to machine learning (Q2191765) (← links)
• The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
• Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
• On tree-constrained matchings and generalizations (Q2258075) (← links)
• Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
• Minimal distance of propositional models (Q2322705) (← links)
• Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
• On the hardness of approximating the min-hack problem (Q2569170) (← links)
• On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
• Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
• The Diagonal Reduction Algorithm Using Fast Givens (Q2799575) (← links)