) , a complexity class representing problems that can be solved by a deterministic Turing machine using a memory space logarithmic to the size of the input.
Recent papers (as late as 2022–2023) continue to cite Yap10 when discussing: Yap10 L 19
is transcendental, Yap's techniques are often reviewed alongside the complexity of , as both involve root-finding algorithms and high-precision arithmetic. Recent Scholarly Reception ) , a complexity class representing problems that
: This established that the language corresponding to the digits of The "L" in your query likely stands for
is in log space" (2010). The "L" in your query likely stands for Logarithmic Space (
: The result focuses on the uniformity of the computation, meaning a single algorithm can produce the digits for any without needing pre-computed tables for different scales.
: Evaluating the exact complexity of specific bits of transcendental and algebraic numbers.