Sciweavers

1004 search results - page 16 / 201
» Product representations of polynomials
Sort
View
JSC
2007
106views more  JSC 2007»
13 years 6 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
CAP
2010
13 years 1 months ago
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
Mickaël Gastineau
KBSE
2010
IEEE
13 years 5 months ago
Eliminating products to test in a software product line
A Software Product Line (SPL) is a family of programs. Testing an SPL is a challenge because the number of programs to examine may be exponential in the number of features. Howeve...
Chang Hwan Peter Kim, Don S. Batory, Sarfraz Khurs...
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
13 years 10 months ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
JAT
2007
103views more  JAT 2007»
13 years 6 months ago
Monotonicity of zeros of Jacobi polynomials
Denote by xn,k(α, β), k = 1, . . . , n, the zeros of the Jacobi polynomial P (α,β) n (x). It is well known that xn,k(α, β) are increasing functions of β and decreasing func...
Dimitar K. Dimitrov, Fernando R. Rafaeli