Improved Algorithms for Sign Determination and Existential Quantifier Elimination | Zendy

John Canny | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improved Algorithms for Sign Determination and Existential Quantifier Elimination

Author(s) -

John Canny

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.5.409

Subject(s) - sign (mathematics) , quantifier elimination , algorithm , symbolic computation , algebraic number , polynomial , transcendental number , variable (mathematics) , mathematics , computer science , algebra over a field , discrete mathematics , pure mathematics , mathematical analysis

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 ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research