Computational Algebraic Geometry

Catalog description

Credits 3. 3 Lecture Hours. Broad introduction to algorithmic algebraic geometry, including numerical and complexity theoretic aspects; theory behind the most efficient modern algorithms for polynomial system solving and the best current quantitative/geometric estimates on algebraic sets over various rings is derived. Prerequisite: MATH 653 or approval of instructor.