Computing in the field of complex algebraic numbers

DOI10.1006/jsco.1997.0158zbMath0910.65029OpenAlexW2037114932MaRDI QIDQ1382036

Adam Wojciech Strzeboński

Publication date: 15 February 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/98764cf7ccbb03080f325876a795ba0dabc604cc

zbMATH Keywords

Mathematicapolynomial equationscomplex algebraic numbersroots of the minimal polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items

The complexity of approximating the complex-valued Potts model, Towards faster real algebraic numbers, Termination of linear programs with nonlinear constraints, Approximating the chromatic polynomial is as hard as computing it exactly, Cylindrical decomposition for systems transcendental in the first variable, Deciding polynomial-transcendental problems, Cylindrical algebraic decomposition using validated numerics, Solving systems of strict polynomial inequalities, Precise numerical computation, Multiplicative independence of algebraic numbers and expressions, Cylindrical algebraic decomposition using local projections, The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs

Uses Software

• Mathematica