Complexity questions in number theory (Q1059094): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02104748 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021335023 / rank | |||
Normal rank | |||
Latest revision as of 08:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity questions in number theory |
scientific article |
Statements
Complexity questions in number theory (English)
0 references
1985
0 references
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 118, 188-210 (Russian) (1982; Zbl 0496.10002).
0 references
computational complexity
0 references
bibliography
0 references
algorithms in number theory
0 references
linear diophantine equations
0 references
quadratic diophantine equations
0 references
diophantine inequalities
0 references
diophantine approximations
0 references
continued fraction algorithm
0 references
open problems
0 references
computational number theory
0 references
0 references
0 references
0 references
0 references
0 references
0 references
