The Computational Complexity of Simultaneous Diophantine Approximation Problems (Q3676213): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:31, 5 February 2024
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
