On the complexity of Gröbner bases conversion

DOI10.1006/JSCO.1998.0276zbMATH Open0939.68170OpenAlexW2056982721MaRDI QIDQ1808671FDOQ1808671

Authors: M. Kalkbrener 

Publication date: 25 November 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0276

Recommendations

• scientific article; zbMATH DE number 3857248
• Counting and Gröbner bases
• Converting bases with the Gröbner walk
• scientific article; zbMATH DE number 3900153

zbMATH Keywords

Gröbner bases

Mathematics Subject Classification ID

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

Cited In (12)

• On the complexity of conversion between classic real number representations
• Change of order for regular chains in positive dimension
• A parametric \(\mathrm{F}_4\) algorithm
• Gröbner systems conversion
• Title not available (Why is that?)
• Free storage basis conversion over finite fields
• Improvement of an incremental signature-based comprehensive Gröbner system algorithm
• On the complexity of computing Gröbner bases in characteristic 2
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Computing Gröbner fans
• On the robust hardness of Gröbner basis computation
• A fast algorithm for Gröbner basis conversion and its applications

This page was built for publication: On the complexity of Gröbner bases conversion

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