Abstract
We survey degree bounds and complexity classes of the word problem for polynomial ideals and related problems. The word problem for general polynomial ideals is known to be exponential space-complete, but there are several interesting subclasses of polynomial ideals that allow for better bounds. We review complexity results for polynomial ideals with low degree, toric ideals, binomial ideals, and radical ideals. Previously known results as well as recent findings in our project “Degree Bounds for Grobner Bases of Important Classes of Polynomial Ideals and Efficient Algorithms” are presented.
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.
