Attempt to find a real number whose computation of bits is NP-complete
Posted by Dannyu NDos, at cs.stackexchange.com,
Recall that every real number $x$ can be expressed as $b + m$, where $b \in \mathbb{Z}$ is the integral part and where $m \in [0…
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs
Overview of attention for article published in Computability, March 2023