Improved Algorithms for Sign Determination and Existential Quantifier Elimination

DOI10.1093/comjnl/36.5.409zbMath0789.68079OpenAlexW2012189264MaRDI QIDQ3140551

John F. Canny

Publication date: 20 June 1994

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.5.409

zbMATH Keywords

quantifier eliminationreal closed fieldssemi-algebraic setssign determination algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (14)

Decision problem for a class of univariate Pfaffian functions ⋮ Global optimality in \(k\)-means clustering ⋮ Efficient evaluation of specific queries in constraint databases ⋮ Zero-nonzero and real-nonreal sign determination ⋮ Linear solving for sign determination ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ On the number of cells defined by a family of polynomials on a variety ⋮ Elementary recursive quantifier elimination based on Thom encoding and sign determination ⋮ Decomposition plans for geometric constraint systems. I: Performance measures for CAD ⋮ On sign conditions over real multivariate polynomials ⋮ A parametric representation of totally mixed Nash equilibria ⋮ Inclusion dynamics hybrid automata ⋮ Matrices in elimination theory ⋮ An algorithm for sums of squares of real polynomials

This page was built for publication: Improved Algorithms for Sign Determination and Existential Quantifier Elimination