We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Certain forms of mathematical expression are used more often than others in practice. A quantitative understanding of actual usage can provide additional information to improve th...
— The paper considers the problem of setting the dimensions of a system of constrained parallel robots to ensure that together they can position an end-effector in a specified s...
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...