25 search results - page 5 / 5 » The algebraic degree of semidefinite programming |
SAC
2010
ACM
14 years 10 days ago
2010
ACM
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
ICPPW
2005
IEEE
13 years 11 months ago
2005
IEEE
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,...
LCPC
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...