Attempts at Computing Gröbner Bases without S-polynomials whenever Possible

Simple item page
dc.contributor.authorAkritas, Alkiviadis G.
dc.contributor.authorMalaschonok, Gennadi
dc.date.accessioned2018-06-06T10:56:52Z
dc.date.available2018-06-06T10:56:52Z
dc.date.issued2017
dc.description.abstractIn 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.en_US
dc.identifier.citationAkritas 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.en_US
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/13218
dc.language.isoenen_US
dc.relation.sourceMathematical Partnership, Parallel Computing and Computer Algebra : International Conference (Israel, Jerusalem, July, 10-16)en_US
dc.statusfirst publisheden_US
dc.subjectGrobner basesen_US
dc.subjectcomputationsen_US
dc.subjectBuchberger’s Original Algorithmen_US
dc.subjectconference materialsen_US
dc.titleAttempts at Computing Gröbner Bases without S-polynomials whenever Possibleen_US
dc.typeConference materialsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Malaschonok_Attempts_at_Computing_grobner.pdf
Size:
36.98 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Кафедра мережних технологій