The Computational Complexity of Simultaneous Diophantine Approximation Problems (Q3676213)
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: The Computational Complexity of Simultaneous Diophantine Approximation Problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of Simultaneous Diophantine Approximation Problems |
scientific article |
Statements
The Computational Complexity of Simultaneous Diophantine Approximation Problems (English)
0 references
1985
0 references
NP-hard
0 references
NP-completeness
0 references
public key cryptography
0 references
short vectors in integral lattices
0 references
integer programming
0 references
algorithms
0 references
computational number theory
0 references
best simultaneous diophantine approximation denominator
0 references
