Sciweavers

187
Voted
ISSAC
2009
Springer
296views Mathematics» more  ISSAC 2009»
15 years 9 months ago
Describing convex semialgebraic sets by linear matrix inequalities
Markus Schweighofer
182
Voted
ISSAC
2009
Springer
282views Mathematics» more  ISSAC 2009»
15 years 9 months ago
Space- and time-efficient polynomial multiplication
Daniel S. Roche
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
15 years 9 months ago
On factorization of multivariate polynomials over algebraic number and function fields
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
15 years 9 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
98
Voted
ISSAC
2009
Springer
174views Mathematics» more  ISSAC 2009»
15 years 9 months ago
Biased tadpoles: a fast algorithm for centralizers in large matrix groups
Daniel Kunkle, Gene Cooperman
Mathematics
Top of PageReset Settings