On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited (Q4960229)
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 7189062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited |
scientific article; zbMATH DE number 7189062 |
Statements
On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (English)
0 references
9 April 2020
0 references
automatic sequences
0 references
applications of subspace theorem
0 references
0 references
0.8433282971382141
0 references
0.7901391983032227
0 references
0.7831577062606812
0 references
0.7658132910728455
0 references
