Pages that link to "Item:Q1382036"
From MaRDI portal
The following pages link to Computing in the field of complex algebraic numbers (Q1382036):
Displaying 16 items.
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Cylindrical decomposition for systems transcendental in the first variable (Q650841) (← links)
- Deciding polynomial-transcendental problems (Q654031) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- An algorithm in a complex field (and its application to the calculation of units) (Q1165897) (← links)
- Does computer algebra help at all learning about real numbers? (Q1404700) (← links)
- Precise numerical computation (Q1779570) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- Solving systems of strict polynomial inequalities (Q1976673) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Cylindrical algebraic decomposition using validated numerics (Q2457384) (← links)
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- Multiplicative independence of algebraic numbers and expressions (Q5951567) (← links)
- Cylindrical algebraic decomposition using local projections (Q5963393) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)