An adjacency algorithm for cylindrical algebraic decompositions of three-dimenslonal space
Journal of Symbolic Computation
A cluster-based cylindrical algebraic decomposition algorithm
Journal of Symbolic Computation
A bibliography of quantifier elimination for real closed fields
Journal of Symbolic Computation
A new algebraic method for robot motion planning and real geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
New lower bound techniques for robot motion planning problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Automatic construction of simple artifact-based business processes
Proceedings of the 12th International Conference on Database Theory
Qualitative kinematics in mechanisms
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
We give an algorithm to construct a cell decomposition of Rd, including adjacency information, defined by any given set of rational polynomials in d variables. The algorithm runs in single exponential parallel time, and in NC for fixed d. The algorithm extends a recent algorithm of Ben-Or, Kozen, and Reif for deciding the theory of real closed fields.