times of QEPCAD B, with and without the preprocessor and

(iv) The structure imposed be dependence among polynomials is studied in terms of the sharing factor.

On the Parameters of CAD
------------------------

Maximum number of terms per polynomial and the highest exponent across all polynomials in a CNF are two of the major parameters which influence the running time of the CAD algorithm. As there is no closed expression for running time of CAD in terms of these parameters, it seems appropriate to plot the variations of these parameters versus the running time. The values presented are averaged over 100 randomly generated prenex formulae. Each prenex formula that is generated, is a CNF, where each clause consists of a set of polynomial equations or inequalities separated by the boolean disjunction. The default random number generator, `rand()` was used.\
\

![Running Time vs. Total number of terms.](noterms.jpg "fig:")\

![Running Time vs. Total number of terms.](power2.jpg "fig:")\

![Running Time vs. Total number of terms.](power3.jpg "fig:")\

![Running Time vs. Total number of terms.](totalterms.jpg "fig:")\

First we fix the maximum number of terms, say T. The number of terms in each polynomial is a random number in between $0$ and $T$. The number of 