Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4526993 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4364546 / rank | |||
Normal rank | |||
Latest revision as of 17:21, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of approximating the minimum solutions of linear Diophantine equations |
scientific article |
Statements
Hardness of approximating the minimum solutions of linear Diophantine equations (English)
0 references
22 June 2009
0 references
NP-hardness
0 references
computational complexity
0 references
linear Diophantine equations
0 references
approximation
0 references
