The Computer Journal · 1993 · 47 citations · 0 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationBoolean AlgebraComputational AlgebraNumber-theoretic AlgorithmsPolynomial CalculusPolynomial Time ComplexityPolynomial-time AlgorithmsQuantifier EliminationReal Closed FieldsSymbolic Computation
Recently there has been a lot of activity in ... In this paper we describe a new sign determination method based on the earlier algorithm, but with two advantages: (i) It is faster in the univariate case, and (ii) In the general case, it allows purely symbolic quantifier elimination in pseudo-polynomial time. By purely symbolic, we mean that it is possible to eliminate a quantified variable from a system of polynomials no matter what the coefficient values are. The previous methods required the coefficients to be themselves polynomials in other variables. Our new