Publication | Closed Access

The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

Mathematical ProgrammingComputational Complexity TheoryEngineeringApproximate OptimaAlgorithmic Information TheoryAlgebraic MethodComputational ComplexityTime ComplexityApproximation MethodComputer ScienceDiscrete MathematicsCombinatorial OptimizationApproximation TheoryLinear Equations