Polynomial Computability of Fields of Algebraic Numbers


Дәйексөз келтіру

Толық мәтін

Ашық рұқсат Ашық рұқсат
Рұқсат жабық Рұқсат берілді
Рұқсат жабық Тек жазылушылар үшін

Аннотация

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.

Авторлар туралы

P. Alaev

Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences; Novosibirsk State University

Хат алмасуға жауапты Автор.
Email: alaev@math.nsc.ru
Ресей, Novosibirsk, 630090; Novosibirsk, 630090

V. Selivanov

Ershov Institute of Informatics System of the Siberian Branch of the Russian Academy of Sciences; Kazan Federal University

Email: alaev@math.nsc.ru
Ресей, Novosibirsk; Kazan, Republic of Tatarstan, 420008

Қосымша файлдар

Қосымша файлдар
Әрекет
1. JATS XML

© Pleiades Publishing, Ltd., 2018