See the initial course handout or if you are printing it out, here's a a postscript version
.

Here is assignment 1
. Since the class background is somewhat varied, you are encouraged to ask questions if you are stumped, or just puzzled.

I will try to post my class notes here. The notes will not exactly correspond to the class meeting; I may leave out stuff (especially if I don't have it in electronic form), and I may put in supplementary material in the notes that I did not get to in class.
Aug 27, intro 1.
Aug 29, basic domains: integers, modular rep and p-adics
Sept 3, basic domains: modular rep and Chinese Remainder
Sept 5, polynomials: rep. eval, interpolation
Sept 10, polynomials: fast mult, powers
Sept 12, the FFT in a finite computation structure, rather detailed postscript file.
Sept 17, polynomial remainder sequence GCDs, more on FFT
Sept 24, determinants, sparse and dense
Sept 26, powerseries
Oct 1 resultants
Oct 3 grobner basis
Oct 8 thm proving, CAD, realroot isolation
Oct 10 modern GCD
Oct 15 Hensel Lemma
Oct 17 Symbolic Integration
Oct 22 Symbolic Integration
Oct 29-Nov 5 Notes on system building and MockMMa in particular

Class projects for this course are included in the 282 directory from this node. I have not yet specifically unpacked, html-ified etc. these guys, but look in 282/eylon, 282/geerjf.lisp, 282/ggsmith. Email: fateman@.cs.berkeley.edu