Upper and Lower Bounds on the Number of Solutions
Jean‐Philippe Martin · 2007
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solutions to a system of equations. For a given size of variables (e.g. 32 bits), the algorithm can be run in time linear in the number of terms and variables, at the cost of looser bounds.