Author:
Sasaki Tateaki,Suzuki Masayuki,Kolár Miroslav,Sasaki Mutsuko
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference18 articles.
1. [Ber67] E.R. Berlekamp, Factorizing polynomials over finite fields. Bell System Tech. J.,46 (1967), 1853–1859.
2. [CG82] A.L. Chistov and D.Y. Grigor’ev, Polynomial-time factoring of multivariate polynomials over a global field. LOMI preprint, Leningrad, 1982.
3. [HS81] J. Heintz and M. Sieveking, Absolute primality of polynomials is decidable in random polynomial time in the number of variables. Proc. 1981 Intn’l Conf. on Automata, Languages and Programming, Lecture Notes in Comp. Sci., vol. 115, Springer, 1981, 16–28.
4. [Kal82a] E. Kaltofen, Factorization of polynomials. Computer Algebra: Symbolic and Algebraic Computation (eds. B. Buchberger, G.E. Collins, and R. Loos.), Springer-Verlag, 1982, 95–113.
5. [Kal82b] E. Kaltofen, A polynomial reduction from multivariate to bivariate integral polynomial factorization. Proc. 1982 ACM Symp. on Theory of Computation, 1982, 261–266
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Numerical Factorization of Polynomials;Foundations of Computational Mathematics;2015-11-19
2. Exact bivariate polynomial factorization over ℚ by approximation of roots;Journal of Systems Science and Complexity;2014-08-28
3. Sparse bivariate polynomial factorization;Science China Mathematics;2014-06-26
4. Cryptography;Handbook of Finite Fields;2013-06-17
5. Towards Industrial Application of Approximate Computer Algebra;Computer Algebra in Scientific Computing;2013