Computing in the field of complex algebraic numbers
From MaRDI portal
Recommendations
Cited in
(23)- Polynomial computability of fields of algebraic numbers
- The complexity of approximating the complex-valued Potts model
- Computation of algebraic numbers and arithmetic operations over them with linear memory
- Cylindrical decomposition for systems transcendental in the first variable
- Deciding polynomial-transcendental problems
- scientific article; zbMATH DE number 4049740 (Why is no real title available?)
- Multiplicative independence of algebraic numbers and expressions
- Termination of linear programs with nonlinear constraints
- Solving systems of strict polynomial inequalities
- Fields of algebraic numbers computable in polynomial time. I
- Cylindrical algebraic decomposition using validated numerics
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
- Towards faster real algebraic numbers
- Affine transformations of algebraic numbers
- Cylindrical algebraic decomposition using local projections
- Exact computations with approximate methods
- Computer algebra procedures for separating the roots of algebraic equations
- scientific article; zbMATH DE number 4118469 (Why is no real title available?)
- Precise numerical computation
- An algorithm in a complex field (and its application to the calculation of units)
- Does computer algebra help at all learning about real numbers?
- Approximating the chromatic polynomial is as hard as computing it exactly
- scientific article; zbMATH DE number 4087009 (Why is no real title available?)
This page was built for publication: Computing in the field of complex algebraic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382036)