Кафедра мережних технологій
Permanent URI for this collection
Browse
Browsing Кафедра мережних технологій by Subject "Buchberger’s Original Algorithm"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Attempts at Computing Gröbner Bases without S-polynomials whenever Possible(2017) Akritas, Alkiviadis G.; Malaschonok, GennadiIn this note we lay down some thoughts on computing Grobner bases using subresultant polynomial remainder sequences (prs’s) to eliminate variables. In this way we try to minimise 5-polynomial computations and, if possible, to completely avoid them. A personal note to us by Bruno Buchberger - at the Polynomial Computer Algebra conference (PCA-2015) in St. Petersburg, Russia - served as the motivation for our effort.