Gröbner bases and generalized sylvester matrices

DOI10.1145/2016567.2016594MaRDI QIDQ5175306zbMATH OpenOpenAlexFDO

Authors Manuela Wiesinger-Widi

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

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(6)

• A general framework for Noetherian well ordered polynomial reductions
• Buchberger-Weispfenning theory for effective associative rings
• Mathematical theory exploration in Theorema: reduction rings
• scientific article; zbMATH DE number 7142706 (Why is no real title available?)
• An algorithm for computing greatest common right divisors of parametric Ore polynomials
• Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

This page was built for publication: Gröbner bases and generalized sylvester matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175306)