Enviar artigo por via de e-mail Polynomial Computability of Fields of Algebraic Numbers
- Autores: Alaev P.E.1,2, Selivanov V.L.3,4
-
Afiliações:
- Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences
- Novosibirsk State University
- Ershov Institute of Informatics System of the Siberian Branch of the Russian Academy of Sciences
- Kazan Federal University
- Edição: Volume 98, Nº 1 (2018)
- Páginas: 341-343
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225529
- DOI: https://doi.org/10.1134/S1064562418050137
- ID: 225529
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
P. Alaev
Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences; Novosibirsk State University
Autor responsável pela correspondência
Email: alaev@math.nsc.ru
Rússia, 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
Rússia, Novosibirsk; Kazan, Republic of Tatarstan, 420008
Arquivos suplementares
