期刊
DOKLADY MATHEMATICS
卷 98, 期 1, 页码 341-343出版社
MAIK NAUKA/INTERPERIODICA/SPRINGER
DOI: 10.1134/S1064562418050137
关键词
-
类别
资金
- RFBR [17-01-00247]
- [1.12878.2018/12.1]
We prove that the field of complex algebraic numbers and the ordered field of real algebraic numbers have isomorphic presentations computable in polynomial time. For these presentations, new algorithms are found for evaluation of polynomials and solving equations of one unknown. It is proved that all best known presentations for these fields produce polynomially computable structures or quotient-structures such that there exists an isomorphism between them polynomially computable in both directions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据