Assignments
Assignment 1 (.pdf)
Assignment 2 (.pdf)
Assignment 3 (.pdf)
Assignment 4 (.pdf)
Assignment 5 (.pdf)
Topics in Computer Algebra, Fall 2021
Lectures: Thurdays 9:30am to 11:30am and Fridays 10:30am to 12:30pm
Room: AQ 5026
Office Hours: Tuesdays 3:00pm to 5:00pm
Zoom link Meeting ID: 643 2518 1923 Password: 774226
Content
For a list of topics and a lecture schedule and course assessement see course information sheet
Handouts and Notes
Maple
We will use Maple for programming and calculations. The following Maple worksheet has some notes for programming in Maple: MapleNotes.mw and MapleNotes.pdf
References
Algorithms for Computer Algebra by Geddes, Czapor and Labahn
Modern Computer Algebra by von zur Gathen and Gerhard
Ideals, Varieties and Algorithmsby Cox, Little and O'Shea
Papers
Lazy and Forgetful Polynomial Arithmetic and Applications by Vrbik and Monagan, Springer LNCS 5743: 226–239, 2009.
Sparse Polynomial Arithmetic by Stephen Johnson, ACM SIGSAM 8(3):63–71, 1974.
Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries by Gentleman and Johnson,
TOMS 2(3): 232–241, 1976.
Maximal Quotient Rational Reconstruction by M. Monagan, Proc. ISSAC '04, pp. 243–249, 2004.
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, W.S. Brown, J. ACM 18(4):478–504, 1971.
Probabilistic algorithms for sparse polynomials. by R. Zippel, Springer LNCS 72:216–226, 1979.
A Deterministic Algorithm for Interpolating Sparse Multivariate Polynomials by M. Ben-Or and P. Tiwari,
Proc. STOC '88, pp. 301–309, 1988.