Sciweavers

4 search results - page 1 / 1
» Trading GRH for algebra: algorithms for factoring polynomial...
Sort
View
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 3 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
13 years 10 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
JSC
2008
162views more  JSC 2008»
13 years 3 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
JMLR
2010
115views more  JMLR 2010»
12 years 10 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto