Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 1950H - Computational Topology |
We will study various algorithmic problems that arise in the study of topological phenomena, such as winding number, turning number, knot polynomials, topology of covering spaces (especially Riemann surfaces), and discrete Morse theory. The mathematical topics will be briefly introduced before we move to computations, but some a priori mathematical sophistication will make the course more valuable to the student. Prerequisite: CSCI 0160, 0180, or 0190.
1.000 Credit hours 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Primary Meeting Computer Science Department Prerequisites: Undergraduate level CSCI 0160 Minimum Grade of S or Undergraduate level CSCI 0180 Minimum Grade of S or Undergraduate level CSCI 0190 Minimum Grade of S |
Return to Previous | New Search |