Abstract
An algorithm of Bruno Buchberger's is extended to polynomial rings over a Noetherian ring. In a specialized version, it can be used for computing elimination ideals. Over fields, it provides the determination of the minimal prime ideals which contain the given ideal, except that the primeness must be proved with other methods. Estimates for computing time are not given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
