On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited.
Boris AdamczewskiJulien CassaigneMarion Le GonidecPublished in: CoRR (2016)
Keyphrases
- computational complexity
- np complete
- computational efficiency
- special case
- np hard
- artificial intelligence
- rate distortion
- motion estimation
- computational cost
- bit rate
- real time
- low complexity
- memory requirements
- high computational complexity
- algebraic expressions
- bayesian networks
- image sequences
- decision making
- decision problems
- storage requirements
- algebraic structure