CS 282. Algebraic Algorithms
Catalog Description: Theory and construction of symbolic algebraic computer programs. Polynomial arithmetic, GCD, factorization, integration of elementary functions, analytic approximation, simplification, design of computer systems and languages for symbolic manipulation.
Units: 3
Prerequisites: 164, Mathematics 113B, or permission of instructor.
Formats:
Fall: 3 hours of lecture per week
Spring: 3 hours of lecture per week
Grading basis: letter
Final exam status: No final exam
Related Areas: