Abstract
We develop a theory, algorithms and implementations to compute sagbi bases for local orderings in a parallel and modular setting. By this method, we can calculate sagbi basis with large size coefficients efficiently by avoiding intermediate coefficients growth. We have implemented these algorithms including modular and parallel implementations and give timings. We also discuss the verification of the modular algorithm to compute sagbi bases.
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.
