Complexity in Computer Algebra (3) Complexity of integer multiplication, polynomial multiplication, fast Fourier transform, division, and calculating the greatest common divisor of poly- nomials.
Complexity in Computer Algebra (3)
General Education: None
Bachelor of Arts: None
Effective: Spring 2008
Prerequisite: CMPSC 465
Note : Class size, frequency of offering, and evaluation methods will vary by location and instructor. For these details check the specific course syllabus.