33 search results - page 2 / 7 » Algorithms for Modular Counting of Roots of Multivariate Pol... |
ISSAC
1999
Springer
13 years 10 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
JC
2000
13 years 6 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
JSC
2010
13 years 4 months ago
2010
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
JCT
2007
13 years 6 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
JSC
2006
13 years 6 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...