Complexity in Computer Algebra

CSE 588 / Math 588  Spring 2008

  • Instructor: Martin Fürer
  • Office hours: 346F IST,  TR 3 - 4
  • Email: furer at cse dot psu dot edu
  • Class Home Page: http://www.cse.psu.edu/~furer/588
  • Meeting: 1:00 - 2:15 Tuesday, Thursday, 333 IST Bldg.
  • Prerequisites: CSE 465 or CSE 565, and a strong interest in mathematical reasoning
  • Textbook: The Design and Analysis of Computer Algorithm,  Addison-Wesley, 1974
  • Authors: Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft
  • Cheap used copies are available on the internet
  • Only part of the book is useful for part of the course
  • Schedule Number: 121060
  • Contents: Complexity of integer multiplication, polynomial multiplication, fast Fourier transform, division, and calculating the greatest common divisor of polynomials. And more, including basics from Algebra (rings, fields, ideals, Chinese remainder theorem), and my new integer multiplication algorithm.
  • Handouts
    •
    Link  Back to the Course Web Pages.