Fields of Algebraic Numbers Computable in Polynomial Time. I (original) (raw)
Related papers
The Arithmetic of Algebraic Numbers: An Elementary Approach
The College Mathematics Journal, 2004
Real Algebraic Numbers: Complexity Analysis and Experimentation
Elias Tsigaridas, Bernard Mourrain
Lecture Notes in Computer Science, 2008
Complexity of computation on real algebraic numbers
Journal of Symbolic Computation, 1990
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science, 2008
Elias Tsigaridas, Bernard Mourrain
Computations with one and two real algebraic numbers
2005
Computing in algebraic systems : (preprint)
1980
Lecture Notes : "Topics in Algebraic Computation"
Comparing Real Algebraic Numbers of Small Degree
Lecture Notes in Computer Science, 2004
Formalized Mathematics, 2016
A Survey on the Complexity of Solving Algebraic Systems
International Mathematical Forum, 2010
The Hardness of Polynomial Equation Solving
Foundations of Computational Mathematics, 2003
Data Structures and Polynomial Equation Solving
Some decision problems for polynomial mappings
Theoretical Computer Science, 1978
COMPUTABLE IMPLEMENTATION OF ``FUNDAMENTAL THEOREM OF ALGEBRA
International Journal of Pure and Apllied Mathematics, 2013
Computing in Algebraic Systems
Recursion Theory, its Generalisations and Applications
Computability and the algebra of fields: Some affine constructions
The Journal of Symbolic Logic, 1980
A Reduction Algorithm for Algebraic Function Fields
Affine transformations of algebraic numbers
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05, 2005
Computing with algebraically closed fields
Journal of Symbolic Computation, 2010
1997
Characterizing Polynomial Time Computability of Rational and Real Functions
Proc. of the 5th International Workshop on De- velopments in Computational Models 2009, 2009
Computing partial information out of intractable: Powers of algebraic numbers as an example
Journal of Number Theory, 2010
2006
Discrete Mathematics and Applications, 1992
Arithmetic with real algebraic numbers is in NC
1990
Nc algorithms for real algebraic numbers
1992
Notes on the decidability of addition and the Frobenius map for polynomials and rational functions
Reports on Mathematical Logic, 2022
A survey of undecidability problems of rings of totally real algebraic integers
2020
Comparison of fourth-degree algebraic numbers and applications to geometric predicates
2000
Chapman & Hall/CRC Applied Algorithms and Data Structures series, 1998
On factorization of multivariate polynomials over algebraic number and function fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation - ISSAC '09, 2009
A note on polynomial time computable arithmetic
1990
On the solution of algebraic equations over finite fields
Information and Control, 1967