Detecting unnecessary reductions in an involutive basis computation
From MaRDI portal
Publication:2456593
DOI10.1016/J.JSC.2004.04.004zbMATH Open1120.13028OpenAlexW2093299949MaRDI QIDQ2456593FDOQ2456593
Authors: Joachim Apel, Ralf Hemmecke 
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2004.04.004
Recommendations
- scientific article; zbMATH DE number 3981150
- Practical, Predictable Lattice Basis Reduction
- Predicting zero reductions in Gröbner basis computations
- On an algorithmic optimization in computation of involutive bases
- Reducing Computational Costs in the Basic Perturbation Lemma
- scientific article; zbMATH DE number 14664
- scientific article; zbMATH DE number 4029739
- An efficient reduction strategy for signature-based algorithms to compute Gröbner basis
- Reducing the complexity of normal basis multiplication
- Improved computation of involutive bases
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
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-commutative Gröbner bases in algebras of solvable type
- On an installation of Buchberger's algorithm
- The theory of involutive divisions and an application to Hilbert function computations
- Title not available (Why is that?)
Cited In (9)
- Thomas decomposition of algebraic and differential systems
- Parallel computation of Janet and Gröbner bases over rational numbers
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- Algorithmic Thomas decomposition of algebraic and differential systems
- Role of involutive criteria in computing Boolean Gröbner bases
- Sufficient set of integrability conditions of an orthonomic system
- A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
- Effectiveness of involutive criteria in computation of polynomial Janet bases
- Involutive bases algorithm incorporating F\(_5\) criterion
This page was built for publication: Detecting unnecessary reductions in an involutive basis computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456593)
