On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229)
From MaRDI portal
scientific article; zbMATH DE number 7189062
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 references
0 references
0 references
