On the complexity of computing Gröbner bases for zero dimensional polynomial ideals
Loading...
Authors
Lakshman, Yagati N.
Issue Date
1990-12
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Computer science
Alternative Title
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
School of Science
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY