Cylindrical algebraic decomposition

From Wikipedia, the free encyclopedia

Given a set of polynomials in Rⁿ and a set S in Rⁿ the Cylindrical algebraic decomposition algorithm finds a decomposition of S in to a number of cells such that for each cell each polynomial has constant sign.

[edit] See also

• Quantifier elimination
• Tarski's theorem

[edit] References

• Strzebonski, Adam. Cylindrical Algebraic Decomposition from MathWorld.
• Cylindrical Algebraic Decomposition in Planning algorithms by Steven M. LaValle. Accessed 13 July 2007