On the complexity of real solving bivariate systems
From MaRDI portal
Recommendations
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Computer Algebra in Scientific Computing
- On the complexity of solving a bivariate polynomial system
- Bounds for polynomials on algebraic numbers and application to curve topology
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
Cited in
(16)- Counting positive solutions for polynomial systems with real coefficients
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Real algebraic numbers and polynomial systems of small degree
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Rational univariate representations of bivariate systems and applications
- On the bit complexity of solving bilinear polynomial systems
- Solving bivariate systems using rational univariate representations
- On the Complexity of Reliable Root Approximation
- Separating linear forms and rational univariate representations of bivariate systems
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
- On the complexity of solving a bivariate polynomial system
- Computer Algebra in Scientific Computing
- On solving systems of bivariate polynomials
- Algorithm for Connectivity Queries on Real Algebraic Curves
- On the topology of real algebraic plane curves
This page was built for publication: On the complexity of real solving bivariate systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301661)
