Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5567392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximating the minimum solutions of linear Diophantine equations |
scientific article; zbMATH DE number 5567392 |
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
0.7585495114326477
0 references
0.7570290565490723
0 references
0.7467500567436218
0 references
0.7453547716140747
0 references
