Computer Science 275
| Title | Computational Algebra |
|---|---|
| Units | 3 |
| Description | Algebraic algorithms for integers, matrices and polynomials. Solution of polynomial systems. Decision algorithms for theories of the real and complex numbers. Algebraic analogues of the P versus NP question. Geometry of real algebraic sets. Universal algorithms for polynomial ideals. |
| Sections | Instructor | Teaching Effectiveness | How worthwhile was this course? |
|---|---|---|---|
| Fall 1993 | John Canny | ||
| Spring 1992 | John Canny | ||
| Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |