Complexity analysis of the bivariate Buchberger algorithm in Theorema

DOI10.1007/978-3-662-44199-2_8MaRDI QIDQ2879096zbMATH OpenOpenAlexFDO

Authors Alexander Maletzky, Bruno Buchberger

Publication date 8 September 2014

Published in Mathematical Software – ICMS 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44199-2_8

zbMATH Keywords

complexity analysisBuchberger algorithmTheoremamathematical theory explorationGröbner basis

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)

Recommendations

• Groebner bases in Theorema
• Mathematical theory exploration in Theorema: reduction rings
• Theorem proving for and with Gröbner bases theory
• scientific article; zbMATH DE number 1303350
• On the application of Buchberger's algorithm to automated geometry theorem proving

Cited in

(2)

• scientific article; zbMATH DE number 782043 (Why is no real title available?)
• scientific article; zbMATH DE number 915924 (Why is no real title available?)

Describes a project that uses

Uses Software

• Theorema
• Mathematica

This page was built for publication: Complexity analysis of the bivariate Buchberger algorithm in Theorema

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