Ideals, Varieties, and Algorithms : an Introduction to Computational Algebraic Geometry and Commutative Algebra /
This book bases its discussion of algorithms on a generalization of the division algorithm for polynomials in one variable that was only discovered in the 1960s. Although the algorithmic roots of algebraic geometry are old, the computational aspects were neglected earlier in this century. This has c...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
1992.
|
| Series: | Undergraduate texts in mathematics.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | This book bases its discussion of algorithms on a generalization of the division algorithm for polynomials in one variable that was only discovered in the 1960s. Although the algorithmic roots of algebraic geometry are old, the computational aspects were neglected earlier in this century. This has changed in recent years, and new algorithms, coupled with the power of fast computers, have led to some interesting applications, for example in robotics and in geometric theorem proving. This book is an introduction to algebraic geometry and commutative algebra aimed primarily at undergraduates. Emphasizing applications and the computational and algorithmic aspects of the subject, the text has much less abstract flavor than standard treatments. With few prerequisites, it is also an ideal introduction to the subject for computer scientists. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (xi, 514 pages) |
| ISBN: | 9781475721812 (electronic bk.) 1475721811 (electronic bk.) |
| ISSN: | 0172-6056 |