Sciweavers

29 search results - page 5 / 6
» issac 2005
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
13 years 11 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
ISSAC
2005
Springer
94views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Domains and expressions: an interface between two approaches to computer algebra
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
Cosmin E. Oancea, Stephen M. Watt
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard