Gröbner bases and generalized sylvester matrices
From MaRDI portal
Publication:5175306
DOI10.1145/2016567.2016594zbMath1305.68375OpenAlexW2090232734MaRDI QIDQ5175306
Publication date: 20 February 2015
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2016567.2016594
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Buchberger-Weispfenning theory for effective associative rings ⋮ Unnamed Item ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Mathematical Theory Exploration in Theorema: Reduction Rings ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
