Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
From MaRDI portal
Publication:3140554
DOI10.1093/comjnl/36.5.432zbMath0789.68080OpenAlexW2022125816MaRDI QIDQ3140554
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.432
cylindrical algebraic decompositiongeometric modellingconsistency problemquantifier elimination problem for elementary real algebrasystem of integral polynomial strict inequalities
Related Items
Maximal irredundant functions, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions, Cylindrical algebraic sub-decompositions, Solving systems of strict polynomial inequalities, Proving inequalities and solving global optimization problems via simplified CAD projection, Partial cylindrical algebraic decomposition for quantifier elimination, Identifying the parametric occurrence of multiple steady states for some biological networks, An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions, Towards physical hybrid systems, Combined Decision Techniques for the Existential Theory of the Reals, Discussion on: ``Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach by D. Nešić and I. M. Y. Mareels, On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions
Uses Software