Author:
Hoeven Joris van der,Lecerf Grégoire
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Algebra and Number Theory
Reference36 articles.
1. Ben-Or, M. Probabilistic algorithms in finite fields. In 22nd Annual Symposium on Foundations of Computer Science (SFCS 1981), pages 394–398. Los Alamitos, CA, USA, 1981. IEEE Computer Society
2. Berlekamp, E.R.: Factoring polynomials over finite fields. Bell. Syst. Tech. J. 46, 1853–1859 (1967)
3. Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24, 713–735 (1970)
4. Bostan, A., Chyzak, F., Giusti, M., Lebreton, R., Lecerf, G., Salvy, B. É. Schost.: Algorithmes Efficaces en Calcul Formel. Frédéric Chyzak (self-published), Palaiseau, 2017. Electronic version available from https://hal.archives-ouvertes.fr/AECF
5. Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36(154), 587–592 (1981)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Local Polynomial Factorisation;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04
3. On the Complexity of Symbolic Computation;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04