Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Finding irreducible polynomials over finite fields;Adleman,1986
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. Evaluating polynomials at fixed sets of points;Aho;SIAM J. Comput.,1975
4. FFT as nested multiplication with a twist;de Boor;SIAM J. Sci. Statist. Comput.,1980
5. A new algorithm for factoring polynomials over finite fields;Cantor;Math. Comp.,1981
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献