Polynomial Computability of Fields of Algebraic Numbers

 
PIIS086956520001685-6-1
DOI10.31857/S086956520001685-6
Publication type Article
Status Published
Authors
Affiliation:
Affiliation:
Journal nameDoklady Akademii nauk
EditionVolume 481 Issue 4
Pages355-357
Abstract

  

Keywords
Received15.10.2018
Publication date28.10.2018
Number of characters500
Cite   Download pdf To download PDF you should sign in
Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

views: 1334

Readers community rating: votes 0

1. Rabin M.O. // Trans. Amer. Math. Soc. 1960. V. 95. P. 341–360.

2. Ershov Yu.L., Ziets. // Math. Logik Grundl. Math. 1977. V. 23. P. 289–371.

3. Goncharov S.S., Ershov Yu.L., Konstruktivnye modeli. Novosibirsk: Nauch. kn. 1999. 345 s.

4. Akho A., Khopkroft Dzh., Ul'man Dzh. Postroenie i analiz vychislitel'nykh algoritmov. M.: Mir, 1979. 536 s.

5. Cenzer D., Remmel J. // Ann. Pure and Appl. Logic. 1991. V. 54. P. 17–58.

6. Coste M., Roy M.F., J. // Symbol. Comput. 1998. V. 5. P. 121–129.

7. Alaev P.E. // Algebra and Logic. 2016. V. 55. № 6. P. 421–435.

8. Collins G.E., Loos R. Computer Algebra: Symbolic and Algebraic Computations. B.: Springer, 1982. P. 83–94.

9. Loos R. Computing in Algebraic Extensions. In: Computer Algebra: Symbolic and Algebraic Computations. B.: Springer, 1982. P. 173–187.

10. Lenstra A. K., Lenstra H. W., Lovász L. // Math. Ann. 1982. V. 261. P. 515–534.

Система Orphus

Loading...
Up