CMSC 456 - Symbolic Computation

(3.00)

The theme of this course is abstract algebra from an algorithmic perspective. Algorithms for computing in groups, rings, fields, ideals, quotient rings and other algebraic objects are studied. For example, the Coxeter coset enumeration and the Groebner basis algorithms are studied. Algebraic varieties play a key role in this course. The course also covers many applications of symbolic computation, such as applications to algebraic coding theory, robotics and automatic theorem proving. There are various projects using a symbolic computation package such as Maple or Mathematica.

Course ID: 052952
Consent: No Special Consent Required
Components: Lecture
You must complete CMSC 341 and MATH 221 and MATH 152 or MATH 142 with a C or better.

Add to Portfolio (opens a new window)