Abstract
Among the fundamental objects studied in algebraic geometry are algebraic varieties which are aggregates of common zeros of polynomial sets, viewed as points in an affine space. In contrast, ideals generated by polynomial sets are typical examples dealt with in commutative algebra. Elimination algorithms provide powerful constructive tools for many problems in these two related areas. In this chapter, we investigate some computational aspects of a few such problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this chapter
Cite this chapter
Wang, D. (2001). Computational algebraic geometry and polynomial-ideal theory. In: Elimination Methods. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6202-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6202-6_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83241-7
Online ISBN: 978-3-7091-6202-6
eBook Packages: Springer Book Archive