Algorithmic Reformulation of Polynomial Problems
Christopher W. Brown · 2007
This paper considers the problem of existential quantifier elimination for real algebra (QE). It introduces an algorithmic framework for exploring reformulations of QE problems, with the goal of finding reformulations that make difficult problems tractable for QE implementations, or for which these implementations find simpler solutions. The program qfr is introduced, which implements this approach, and its performance on some example problems is reported.