Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference72 articles.
1. A. Ayad, “Complexity bound for the absolute factorization of parametric polynomials,” Zap. Nauchn. Semin, POMI, 316, 5–29 (2004).
2. A. Ayad. “Complexité de la résolution des systèmes algébriques paramétriques,” PhD thesis, University of Rennes 1 (2006).
3. S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, Springer, New York (2003).
4. E. R. Berlckamp, “Factoring polynomials over finite fields,” Bell Systems Tech. J., 46, 1853–1859 (1967).
5. E. R. Berlekamp, “Factoring polynomials over large finite fields,” Math. Comp., 24, 713–735 (1970).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sparse Rational Univariate Representation;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23