On solving systems of bivariate polynomials
From MaRDI portal
Recommendations
Cited in
(20)- Numerical solution of bivariate and polyanalytic polynomial systems
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Solving bivariate systems using rational univariate representations
- On the complexity of solving a bivariate polynomial system
- Solutions to systems of binomial equations
- p-adic algorithm for bivariate Gröbner bases
- scientific article; zbMATH DE number 1795740 (Why is no real title available?)
- Solvability of bivariate polynomial systems under perturbation
- scientific article; zbMATH DE number 1262451 (Why is no real title available?)
- On the complexity of computing with planar algebraic curves
- scientific article; zbMATH DE number 851023 (Why is no real title available?)
- A special case of resolving polynomials
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- BertiniLab: a MATLAB interface for solving systems of polynomial equations
- Nearly optimal refinement of real roots of a univariate polynomial
- scientific article; zbMATH DE number 910294 (Why is no real title available?)
- On solvability of systems of polynomial equations
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Exact symbolic-numeric computation of planar algebraic curves
- Experimental and Efficient Algorithms
This page was built for publication: On solving systems of bivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747869)