Asymmetric approach to computation of Gröbner bases

DOI10.1007/S10958-008-0062-8zbMATH Open1146.13016OpenAlexW2014747065MaRDI QIDQ950850FDOQ950850

Authors: B. E. Eshmatov 

Publication date: 28 October 2008

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-008-0062-8

Recommendations

• scientific article; zbMATH DE number 2151220
• Algorithmische Aspekte zur Theorie der Gröbner-Basen. (Algorithmic aspects of the theory of Gröbner bases)
• A new framework for computing Gröbner bases
• On an installation of Buchberger's algorithm
• A new efficient algorithm for computing Gröbner bases \((F_4)\)

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)

Cites Work

• Involutive bases of polynomial ideals
• Minimal involutive bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast search for the Janet divisor
• The theory of involutive divisions and an application to Hilbert function computations
• Involutive systems of algebraic equations
• Title not available (Why is that?)
• Computer Algebra in Scientific Computing
• Involutive division techniques: some generalizations and optimizations
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• On an installation of Buchberger's algorithm
• Continuously parameterized symmetries and Buchberger's algorithm
• Buchberger-Weispfenning theory for effective associative rings
• A new algorithm for computing staggered linear bases
• Computing inhomogeneous Gröbner bases

This page was built for publication: Asymmetric approach to computation of Gröbner bases

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