Fields of Algebraic Numbers Computable in Polynomial Time. I
- 1 January 2020
- journal article
- research article
- Published by Springer Nature in Algebra and Logic
- Vol. 58 (6) , 447-469
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Structures Computable in Polynomial Time. IAlgebra and Logic, 2017
- Existence and Uniqueness of Structures Computable in Polynomial TimeAlgebra and Logic, 2016
- Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition1998
- A Course in Computational Algebraic Number Theory1993
- On the degree of extensions generated by finitely many algebraic numbersJournal of Number Theory, 1990
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Computing in Algebraic Extensions1982
- Quantifier elimination for real closed fields by cylindrical algebraic decompostion1975
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- Computable Algebra, General Theory and Theory of Computable FieldsTransactions of the American Mathematical Society, 1960