Fields of Algebraic Numbers Computable in Polynomial Time. I
暂无分享,去创建一个
[1] R. Loos. Computing in Algebraic Extensions , 1983 .
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Alkiviadis G. Akritas,et al. Elements of Computer Algebra with Applications , 1989 .
[4] Zhou Jian-Ping. On the degree of extensions generated by finitely many algebraic numbers , 1990 .
[5] Ju. L. Ers. Theorie Der Numerierungen III , 1977, Math. Log. Q..
[6] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[7] M. Rabin. Computable algebra, general theory and theory of computable fields. , 1960 .
[8] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[9] G. E. Collins,et al. Real Zeros of Polynomials , 1983 .
[10] P. E. Alaev. Existence and Uniqueness of Structures Computable in Polynomial Time , 2016 .
[11] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[12] P. E. Alaev,et al. Structures Computable in Polynomial Time. I , 2017 .
[13] George E. Collins,et al. The Calculation of Multivariate Polynomial Resultants , 1971, JACM.
[14] J. Ersov. Theorie der Numerierungen II , 1973 .
[15] Franz Winkler,et al. Polynomial Algorithms in Computer Algebra , 1996, Texts and Monographs in Symbolic Computation.