Lingchuan Meng
Abstract
Polynomial multiplication is a key algorithm underlying computer algebra systems (CAS) and its efficient implementation is crucial for the performance of CAS. In this context coefficients of polynomials come from domains such as the integers, rationals and finite fields where arithmetic is performed exactly without rounding error.
Recommendations
Abstracts of recent doctoral dissertations in computer algebra
Each quarter we are pleased to present abstracts of recent doctoral dissertations in Computer Algebra and Symbolic Computation. We encourage all recent Ph.D. graduates who have defended in the past two years (and their supervisors), to submit their ...
Abstracts of recent doctoral dissertations in computer algebra
Each quarter we are pleased to present abstracts of recent doctoral dissertations in Computer Algebra and Symbolic Computation. We encourage all recent Ph.D. graduates who have defended in the past two years (and their supervisors), to submit their ...
Comments