Fields of Algebraic Numbers Computable in Polynomial Time. I-Reference-Cited by-同舟云学术

Fields of Algebraic Numbers Computable in Polynomial Time. I

Published:2020-01 Issue:6 Volume:58 Page:447-469
ISSN:0002-5232
Container-title:Algebra and Logic
language:en
Short-container-title:Algebra Logic

Author:

Alaev P. E.,Selivanov V. L.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10469-020-09565-0.pdf

Reference18 articles.

1. D. Cenzer and J. B. Remmel, “Complexity theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (Eds.), Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998), pp. 381-513.

2. G. E. Collins and R. Loos, “Real zeroes of polynomials,” in Computer Algebra. Symbolic and Algebraic Computations, Comput. Suppl., 4, Springer-Verlag, New York (1982), pp. 83-94.

3. R. Loos, “Computing in algebraic extensions,” in Computer Algebra: Symbolic and Algebraic Computations, Comput. Suppl., 4, Springer-Verlag, New York (1982), 173-187.

4. A. K. Lenstra, H. W. Lenstra, and L. Lovász, “Factoring polynomials with rational coefficients,” Math. Ann., 261, 515-534 (1982).

5. M. O. Rabin, “Computable algebra, general theory and theory of computable fields,” Trans. Am. Math. Soc., 95, 341-360 (1960).

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective Lower Bounds on the Matrix Rank and Their Applications;Programming and Computer Software;2023-10

2. The Complexity of Inversion in Groups;Algebra and Logic;2023-05

3. Generalization of the Subset Sum Problem and Cubic Forms;Computational Mathematics and Mathematical Physics;2023-01

4. A Criterion for P-Computability of Structures;Algebra and Logic;2022-11

5. ON COMPUTATIONS OVER ORDERED RINGS;SIB ELECTRON MATH RE;2022