224 search results - page 18 / 45 » Homogeneous Decomposition of Polynomials |
152
click to vote
ISSAC
2007
Springer
16 years 14 hour ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
161
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
179
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
150
click to vote
ISSAC
2009
Springer
16 years 13 days ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
147
click to vote
ICPPW
2005
IEEE
15 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,...