Pages that link to "Item:Q5633582"
From MaRDI portal
The following pages link to Integer Arithmetic Algorithms for Polynomial Real Zero Determination (Q5633582):
Displaying 25 items.
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
- On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Computer algebra applied to itself (Q1106662) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation (Q1137352) (← links)
- An implementation of Vincent's theorem (Q1142536) (← links)
- Vincent's forgotten theorem, its extension and application (Q1162110) (← links)
- Exact algorithms for polynomial real root approximation using continued fractions (Q1171358) (← links)
- Trigonometric polynomials with simple roots (Q1183395) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130) (← links)
- On the forgotten theorem of Mr. Vincent (Q1251646) (← links)
- On the solution of polynomial equations using continued fractions (Q1258594) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- An efficient method for analyzing the topology of plane real algebraic curves. (Q1565839) (← links)
- Congruence arithmetic algorithms for polynomial real zero determination (Q1846327) (← links)
- Complexity of deciding the first-order theory of real closed fields (Q2277024) (← links)
- Polynomial real root approximation using continued fractions (Q3666149) (← links)
- The Minimum Root Separation of a Polynomial (Q4404316) (← links)
- Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)
- Semantics of computable physical models (Q6057623) (← links)
- Decision problem for a class of univariate Pfaffian functions (Q6122406) (← links)