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

Arora, S., Babai, L., Stern, J., & Sweedyk, Z. (1997). The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. Journal of Computer and System Sciences, 317-331.

Type

Journal article

Intellectual base

Primary research

Year

1997

Pages

317-331

DOI

10.1006/jcss.1997.1472

DOI registrant

Elsevier

Link

https://doi.org/10.1006/jcss.1997.1472

Cited by

1 citation across 1 artifact.

Domain-specific

• Minimum Relevant Variables in a Linear System
  • Complexity results manage expectations: poor worst-case approximability means that a universally reliable near-optimal polynomial algorithm is unlikely under the cited assumptions.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:5078fce615ef · see in the full table