Sciweavers

461 search results - page 5 / 93
» Practical polynomial factoring in polynomial time
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 2 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
JSC
2007
80views more  JSC 2007»
13 years 7 months ago
Improved dense multivariate polynomial factorization algorithms
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Grégoire Lecerf
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 17 days ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
TNN
2008
128views more  TNN 2008»
13 years 7 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 7 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy