Abstract
This paper introduces a variation of Buchbergers’s algorithm for computing Grobner bases in order to avoid intermediate coefficient swell. It is designed to keep coefficients small and polynomials short during the computation. This pays off in computation time as well as memory usage.
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.
