Abstract
Computer Algebra is a field of mathematics and computer science that studies algorithms for symbolic computation. A fundamental tool in computer algebra to study polynomial ideals is the theory of Geobner basis. The notion of the Grobner basis and the Buchberger’s algorithm for computing it was proposed by Bruno Buchberger in 1965. Grobner bases have numerous applications in commutative algebra, algebraic geometry, combinatorics, coding theory, cryptography, theorem proving, etc. The Buchberger’s algorithm is implemented in many computer algebra systems, such as Risa/Asir, Macaulay2, Singular, CoCoa, Maple, and Mathematica. In this chapter, we will give a short introduction on Grobner basis theory, and then we will present some applications of Grobner bases.
Sign-in/Register to access full text options 
Free) 
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 call
