224 search results - page 3 / 45 » Homogeneous Decomposition of Polynomials |
104
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
FCSC
2008
14 years 10 months ago
2008
Abstract. We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are high...
ASPDAC
2008
ACM
15 years 7 days ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
101
Voted
COCO
2008
Springer
15 years 11 hour ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
73
Voted
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...