Pages that link to "Item:Q4960229"
From MaRDI portal
The following pages link to On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229):
Displaying 5 items.
- Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms (Q1267296) (← links)
- Mahler's method (Q2279220) (← links)
- (Q3875997) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents (Q6201925) (← links)