On the hardness of approximating shortest integer relations among rational numbers (Q1274930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of approximating shortest integer relations among rational numbers |
scientific article; zbMATH DE number 1238698
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating shortest integer relations among rational numbers |
scientific article; zbMATH DE number 1238698 |
Statements
On the hardness of approximating shortest integer relations among rational numbers (English)
0 references
12 January 1999
0 references
approximation algorithm
0 references
computational complexity
0 references
integer relations
0 references
NP-hard
0 references
probabilistically checkable proofs
0 references
2-prover 1-round interactive proof systems
0 references
label cover
0 references
0 references
0 references
