Author:
Giesbrecht Mark,Jamshidpey Armin,Schost Éric
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference36 articles.
1. D. Augot & P. Camion (1994). A deterministic algorithm for computing a normal basis in a finite field. In Proc. EUROCODE'94, P. Charpin, editor.
2. E. Bach & J. Shallit (1996). Algorithmic Number Theory, Volume 1: Efficient Algorithms. MIT Press, Cambridge, MA.
3. A. Bostan, P. Flajolet, B. Salvy & É. Schost (2006). Fast computation of special resultants. J. Symbolic Comput. 41(1), 1–29.
4. A. Bostan, C.-P. Jeannerod, C. Mouilleron & É. Schost (2017). On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. SIAM Journal on Matrix Analysis and Applications 38(3), 733–775.
5. R. P. Brent & H. T. Kung (1978). Fast algorithms for manipulating formal power series. Journal of the Association for Computing Machinery 25(4), 581–595.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster Modular Composition;Journal of the ACM;2023-12-25