Sciweavers

135 search results - page 5 / 27
» Improved dense multivariate polynomial factorization algorit...
Sort
View
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
13 years 11 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Factoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
Chandan Saha
ISVC
2009
Springer
14 years 2 months ago
Factorization of Correspondence and Camera Error for Unconstrained Dense Correspondence Applications
Abstract. A correspondence and camera error analysis for dense correspondence applications such as structure from motion is introduced. This provides error introspection, opening u...
Daniel Knoblauch, Mauricio Hess-Flores, Mark A. Du...
LATIN
2010
Springer
14 years 2 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
13 years 11 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
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 ...
Erich Kaltofen, Michael B. Monagan