Assignment 1 (.pdf)
C code for FFT1 (.pdf)
C code for FFT2 (.pdf)
Assignment 2 (.pdf)
Assignment 3 (.pdf)
Assignment 4 (.pdf)
Assignment 5 (.pdf)
Topics in Computer Algebra, Summer 2017
We will meet in room TBA on Tuesdays and Thursdays from 9:30-11:30pm till July 6th.
To register for the course, please contact the Graduate secretary in Mathematics
For a list of topics and a lecture schedule and course assessement see course information sheet
Five assigments worth 12% each plus a course project worth 40%.
Algorithms for Computer Algebra by Geddes, Czapor and Labahn
Modern Computer Algebra by von zur Gathen and Gerhard
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, W.S. Brown, 1971.
On the Design and Implementation of Brown’s Algorithm over the Integers and Number Fields, Monagan and Wittkopf, 2000.
Probabilistic algorithms for interpolating polynomials. by R. Zippel, 1979.
Interpolating polynomials from their values. by R. Zippel, 1990.
A Deterministic Algorithm for Interpolating Sparse Multivariate Polynomials by M. Ben-Or and P. Tiwari.
Example of Ben-Or/Tiwari algorithm Maple worksheet (.mw) and a (.pdf) version.
A Fast Parallel Sparse Polynomial GCD Algorithm.by Hu and Monagan, 2016.
Maple code for the Berlekamp - Massey algorithm
P-adic Reconstruction of Rational Numbers by Guy, Davenport and Wang.
Maximal Quotient Rational Reconstruction by Monagan.
Algebraic Factoring and Rational Function Integration by B. Trager.
Sparse Polynomial Arithmetic by Stephen Johnson.
Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries by Gentleman and Johnson
Lazy and Forgetful Polynomial Arithmetic and Applications by Vrbik and Monagan.