J. F. Canny. Improved algorithms for sign and existential quantifier elimination. The Computer Journal, 36:409-- 418, 1993. In a special issue on computational quantifier elimination, edited by H. Hong.  Home/Search   Document Not in Database   Summary   Related Articles

....engineering can be reduced to the problem of testing positiveness of polynomials. In 1930, Tarski [33, 34] showed that the problem is decidable. In fact, he gave a decision method for a more general problem than just testing positiveness. Since then, many improvements and new methods were proposed [7, 1, 26, 2, 3, 27, 13, 35, 30, 14, 15, 16, 9, 29, 17, 28, 6, 20, 19, 18, 25, 36, 8, 21, 22, 5, 12, 23]. However, these methods are computationally expensive due to their generality. Naturally one is interested in devising more efficient methods for the sub problem: testing positiveness. But then, this sub problem turns out to be still difficult. Thus, several authors (mainly from the field of term ....

J. F. Canny. Improved algorithms for sign and existential quantifier elimination. The Computer Journal, 36:409-- 418, 1993. In a special issue on computational quantifier elimination, edited by H. Hong.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC