Cylindrical algebraic decomposition

Given a set of polynomials in R^{n} and a set S in R^{n} 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.
See also
References
 Strzebonski, Adam. Cylindrical Algebraic Decomposition from MathWorld.
 Cylindrical Algebraic Decomposition in Planning algorithms by Steven M. LaValle. Accessed 13 July 2007
This algebrarelated article is a stub. You can help Wikipedia by expanding it.