The Computational Complexity of Simultaneous Diophantine Approximation Problems (Q3676213): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0214016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150529683 / rank | |||
Normal rank | |||
Latest revision as of 00:06, 20 March 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
