| 000 | 00986nam a2200205Ia 4500 | ||
|---|---|---|---|
| 020 | _a978331 9167206 | ||
| 082 |
_a516.35 _bCOX |
||
| 100 | _aCox, David A | ||
| 245 | 3 | _a Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra / | |
| 250 | _a4th ed. | ||
| 260 |
_aNew York _cc2015 _bSpringer |
||
| 300 | _axvi, 646p. | ||
| 490 | _aUndergraduate texts in Mathematics | ||
| 520 | _aAlgebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated? The solutions of a system of polynomial equations form a geometric object called a variety; the corresponding algebraic object is an ideal. | ||
| 650 | _aAlgorthms | ||
| 650 | _aAlgebra | ||
| 650 | _aCommutative algebra | ||
| 942 | _cBK | ||
| 942 | _cBK | ||
| 999 |
_c2670 _d2670 |
||