On the complexity of computing Gröbner bases for zero dimensional polynomial ideals

Authors
Lakshman, Yagati N.
ORCID
Loading...
Thumbnail Image
Other Contributors
Kaltofen, Erich
Caviness, Bobby F.
Goldberg, Mark
Krishnamoorthy, M. S.
McLaughlin, H. W.
usser, David R.
Issue Date
1990-12
Keywords
Computer science
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
We also generalize the change of basis algorithm of Faugère et al. to derive efficient new algorithms for computing Gröbner bases for intersections, quotients and images under linear transformation for zero-dimensional ideals.
Description
December 1990
School of Science
Department
Dept. of Computer Science
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.