Algorithms for Solving Polynomial Systems



Because of the previously mentioned NP-Complete status of MQ, the topic of how to actually solve these systems has the disadvantage that truly efficient (i.e. polynomial time) algorithms have not yet been found. In fact, they will never be found if P ≠ NP. Nonetheless, there are algorithms available for experimentation, many of which we describe below.


Polynomial Equation Gaussian Elimination Polynomial System Quadratic System Univariate Polynomial 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.Department of MathematicsFordham UniversityBronxUSA

Personalised recommendations