Detecting unnecessary reductions in an involutive basis computation-Reference-Cited by-同舟云学术

Detecting unnecessary reductions in an involutive basis computation

Published:2005-10 Issue:4-5 Volume:40 Page:1131-1149
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Apel Joachim,Hemmecke Ralf

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference15 articles.

1. The theory of involutive divisions and an application to Hilbert function computations;Apel;Journal of Symbolic Computation,1998

2. Apel, J., 1998b. Zu Berechenbarkeitsfragen der Idealtheorie. Habilitationsschrift, Universität Leipzig, Fakultät für Mathematik und Informatik, Augustusplatz 10–11, 04109 Leipzig

3. An extension of Buchberger’s algorithm and calculations in enveloping fields of Lie algebras;Apel;Journal of Symbolic Computation,1988

4. Gröbner Bases;Becker,1993

5. Buchberger, B., 1965. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, Univ. Innsbruck, Dept. of Math., Innsbruck, Austria

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Gröbner Bases with Reduction Machines;Electronic Proceedings in Theoretical Computer Science;2019-09-02

2. Internal Coordinates and Total Derivatives;The Symbolic Computation of Integrability Structures for Partial Differential Equations;2017

3. Involutive bases algorithm incorporating F 5 criterion;Journal of Symbolic Computation;2013-12

4. Algorithmic Thomas decomposition of algebraic and differential systems;Journal of Symbolic Computation;2012-10

5. Comprehensive Involutive Systems;Computer Algebra in Scientific Computing;2012