Complexity questions in number theory (Q1059094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity questions in number theory |
scientific article; zbMATH DE number 3902729 |
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
