Polynomial Equation System Solver

Grégoire Lecerf



  • It can efficiently solve systems containing inequations;
  • The running time complexity is linear in the evaluation complexity of the given system and polynomial in a certain geometric degree of the given system;
  • Probabilistic algorithm;
  • On some examples Kronecker is faster than many other methods;
  • Basic support for MathML.

© Centre National de la Recherche Scientifique.
Last update: lun jui 1 13:52:33 UTC 2002