Akritas, Alkiviadis G.Malaschonok, Gennadi2018-06-062018-06-062017Akritas A. Attempts at Computing Gröbner Bases without S-polynomials whenever Possible / Alkiviadis G. Akritas, Gennadi Malaschonok // Mathematical Partnership, Parallel Computing and Computer Algebra : International Conference (Israel, Jerusalem, July, 10-16). - Tambov: Publishing House of TSU, 2017. - P. 40-41.https://ekmair.ukma.edu.ua/handle/123456789/13218In 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.enGrobner basescomputationsBuchberger’s Original Algorithmconference materialsConference materials