Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Author(s)
Bibliographic Information
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
（Undergraduate texts in mathematics）
Springer-Verlag, c1992
- : us
- : gw
Available at / 92 libraries
-
: gw411.8:CY3017713,
: us411.8:CY4021896, : us411.8:CY4021902, : us411.8:CY4021910 -
University of Tsukuba Library, Library on Library and Information Science
: us411.8:C-89941001620
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
: usdc20:516.3/c8392070243824
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. [499]-501
Includes index
Description and Table of Contents
- Volume
-
: us ISBN 9780387978475
Description
Written at a level appropriate to undergraduates, this book covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. Contains a new section on Axiom and an update about MAPLE, Mathematica and REDUCE.
- Volume
-
: gw ISBN 9783540978473
Description
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 less abstract flavour than standard treatments. With few prerequisites, it should also a useful introduction to the subject for computer scientists.
by "Nielsen BookData"