Improved Algorithms for Sign Determination and Existential Quantifier Elimination

DOI10.1093/COMJNL/36.5.409MaRDI QIDQ3140551zbMATH OpenOpenAlexFDO

Authors John 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)

Recommendations

• scientific article; zbMATH DE number 177865
• New results on quantifier elimination over real closed fields and applications to constraint databases
• scientific article; zbMATH DE number 589121
• Quantifier elimination for real algebra -- the quadratic case and beyond
• On the combinatorial and algebraic complexity of quantifier elimination

Cited in

(19)

• scientific article; zbMATH DE number 589121 (Why is no real title available?)
• Matrices in elimination theory
• A parametric representation of totally mixed Nash equilibria
• scientific article; zbMATH DE number 177865 (Why is no real title available?)
• Zero-nonzero and real-nonreal sign determination
• Solving divergence in Knuth--Bendix completion by enriching signatures
• An algorithm for sums of squares of real polynomials
• On the number of cells defined by a family of polynomials on a variety
• Inclusion dynamics hybrid automata
• On the Theoretical and Practical Complexity of the Existential Theory of Reals
• Efficient evaluation of specific queries in constraint databases
• Efficient simplification techniques for special real quantifier elimination with applications to the synthesis of optimal numerical algorithms
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• Linear solving for sign determination
• Decision problem for a class of univariate Pfaffian functions
• On sign conditions over real multivariate polynomials
• Global optimality in k-means clustering
• Elementary recursive quantifier elimination based on Thom encoding and sign determination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140551)