Solving sparse polynomial systems using Groebner bases and resultants

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these equations have been employed to model and solve probl...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavný autor:	Bender, Matías R
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 19.05.2022
Predmet:	Algorithms Continuation methods Cryptography Polynomials Resultants Robotics Sparsity
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!