代数数的位计算
Computing Bits of Algebraic Numbers
摘要:
我们开始了计算(实)代数数的位的问题的复杂性理论研究。这扩展了Yap在对数空间中计算像π这样的超越数位的工作。我们的主要结果是,计算一个固定的实代数数位是在C= NC 1 \subseteq日志空间时,位的位置有一个冗长的(一元)表示和计数层次时,它有一个简洁的(二进制)表示。我们的工具是从元素分析和数值分析,并包括牛顿-拉夫森方法。我们的主要结果的证明完全是初等的,更喜欢使用初等的刘维尔定理,而不是更深层次的代数数的罗斯定理。我们离开的可能性证明非平凡的下界的问题,计算一个代数数的位在二进制位的位置,作为我们的主要开放问题。在这个方向上,我们通过证明一个有理数的下界,显示出非常有限的进展。
英文摘要:
We initiate the complexity theoretic study of the problem of computing the bits of (real) algebraic numbers. This extends the work of Yap on computing the bits of transcendental numbers like π, in Logspace. Our main result is that computing a bit of a fixed real algebraic number is in C=NC1\subseteq Logspace when the bit position has a verbose (unary) representation and in the counting hierarchy when it has a succinct (binary) representation. Our tools are drawn from elementary analysis and numerical analysis, and include the Newton-Raphson method. The proof of our main result is entirely elementary, preferring to use the elementary Liouville's theorem over the much deeper Roth's theorem for algebraic numbers. We leave the possibility of proving non-trivial lower bounds for the problem of computing the bits of an algebraic number given the bit position in binary, as our main open question. In this direction we show very limited progress by proving a lower bound for rationals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。