The Basic Polynomial Algebra Subprograms
暂无分享,去创建一个
[1] Arnold Schönhage,et al. Schnelle Multiplikation großer Zahlen , 1971, Computing.
[2] Marc Moreno Maza,et al. FFT-Based Dense Polynomial Arithmetic on Multi-cores , 2009, HPCS.
[3] Joachim von zur Gathen,et al. Fast algorithms for Taylor shifts and certain difference equations , 1997, ISSAC.
[4] Marc Moreno Maza,et al. The modpn library: Bringing fast polynomial arithmetic into Maple , 2011, J. Symb. Comput..
[5] Changbo Chen,et al. Cache Complexity and Multicore Implementation for Univariate Real Root Isolation , 2012 .
[6] Farnam Mansouri,et al. On The Parallelization Of Integer Polynomial Multiplication , 2014 .
[7] Marc Moreno Maza,et al. Balanced Dense Polynomial Multiplication on Multi-Cores , 2011, Int. J. Found. Comput. Sci..
[8] Charles E. Leiserson,et al. The Cilk++ concurrency platform , 2009, 2009 46th ACM/IEEE Design Automation Conference.
[9] Jacques Laskar,et al. Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-Core Systems , 2013, CASC.
[10] Matteo Frigo,et al. Cache-oblivious algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[11] Richard D. Jenks,et al. AXIOM: the scientific computation system , 1992 .
[12] Michael B. Monagan,et al. Parallel sparse polynomial multiplication using heaps , 2009, ISSAC '09.
[13] Steven G. Johnson,et al. The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.