Groebner Basis and its Applications
| dc.contributor.advisor | Bekele, Berhanu(PhD) | |
| dc.contributor.author | Belete, Solomon | |
| dc.date.accessioned | 2018-07-18T07:03:22Z | |
| dc.date.accessioned | 2023-11-04T12:30:35Z | |
| dc.date.available | 2018-07-18T07:03:22Z | |
| dc.date.available | 2023-11-04T12:30:35Z | |
| dc.date.issued | 2012-06 | |
| dc.description.abstract | In this thesis we present the basic concepts and results of Groebner basis for a polynomial ideal over a field and introduce an algorithm for computing and then present an improvement of Buchberger's algorithms for computing Groebner basis by reducing number of S-polynomials without computing them. This paper deals with Groebner basis for a polynomial ideal over a ring by defining the module of a solution of a homogenous linear equation with polynomial coeffcients (called the syzygy module). And finally, we will see the application of Groebner basis in detail. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9136 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Groebner Basis and its Applications | en_US |
| dc.title | Groebner Basis and its Applications | en_US |
| dc.type | Thesis | en_US |