Bünyamin İzzet İnan, “An Algorithm for Rational Simplification Modulo a Polynomial Ideal”, 27 Mart 2013
Bilgisayar Mühendisliği Bölümü Semineri #19:
 |
Başlık: | An Algorithm for Rational Simplification Modulo a Polynomial Ideal |
| Konuşmacı: | Bünyamin İzzet İnan, B.Sc. Candidate, Yaşar University | |
| Tarih: | 27 Mart 2013 | |
| Saat: | 17:15-18:00 | |
| Yer: | Bilgisayar Ağları Laboratuvarı | |
| Sunum Dili: | İngilizce |
Abstract: The aim of this presentation is to explain Monagan-Pearce rational simplification algorithm. It first starts with the key ideas about rational polynomial simplification, then moves on to some basic definitions on are fields, ideals, and Groebner basis. Finally, the multivariate polynomial division algorithm, Groebner basis computation algorithm, and Monagan-Pearce algorithm is explained.