This article is cited in 2 scientific papers (total in 2 papers)
Fields of algebraic numbers computable in polynomial time. I
P. E. Alaevab, V. L. Selivanovcd
a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University
c A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
d Kazan (Volga Region) Federal University
It is proved that the field of complex algebraic numbers has an isomorphic presentation computable in polynomial time. A similar fact is proved for the ordered field of real algebraic numbers. The constructed polynomially computable presentations are based on a natural presentation of algebraic numbers via rational polynomials. Also new algorithms for computing values of polynomials on algebraic numbers and for solving equations in one variable with algebraic coefficients are presented.
field of complex algebraic numbers, ordered field of real algebraic numbers, polynomially computable presentation.
|Russian Foundation for Basic Research
|Ministry of Science and Higher Education of the Russian Federation
|Supported by RFBR (project No. 17-01-00247) and by the RF Ministry of Science and Higher Education (state assignment to Sobolev Institute of Mathematics, SB RAS, project No. 0314-2019-0002).
The work was carried out at the expense of the subsidy allocated to Kazan (Volga Region) Federal University for the fulfillment of the state assignment in the sphere of scientific activity, project No. 1.13556.2019/13.1.
PDF file (377 kB)
First page: PDF file
Algebra and Logic, 2020, 58:6, 447–469
P. E. Alaev, V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. I”, Algebra Logika, 58:6 (2019), 673–705; Algebra and Logic, 58:6 (2020), 447–469
Citation in format AMSBIB
\by P.~E.~Alaev, V.~L.~Selivanov
\paper Fields of algebraic numbers computable in polynomial time. I
\jour Algebra Logika
\jour Algebra and Logic
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
P. E. Alaev, “Polynomially computable structures with finitely many generators”, Algebra and Logic, 59:3 (2020), 266–272
A. V. Seliverstov, “Dvoichnye resheniya dlya bolshikh sistem lineinykh uravnenii”, PDM, 2021, no. 52, 5–15
|Number of views:|