MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive


Does anybody know if there is a Mathematica implementation of the  
Bernstein, Khovanski, Kushnirenko bound on the number of zeros of a  
sparse regular polynomial system?
(Actually, I think this really ought to be a built-in function.)

Andrzej Kozlowski

Chiba, Japan

  • Prev by Date: Re: Simplify and FullSimplify
  • Next by Date: Finite differences
  • Previous by thread: Fw: Re: Set of strings reducing problem
  • Next by thread: Finite differences