Complexity results for triangular sets-Reference-Cited by-同舟云学术

Complexity results for triangular sets

Published:2003-09 Issue:3-4 Volume:36 Page:555-594
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Schost Éric

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference54 articles.

1. Zeros, multiplicities and idempotents for zero-dimensional systems;Alonso,1996

2. Aubry, P., 1999. Ensembles triangulaires de polynômes et résolution de systèmes algébriques, Implantation en Axiom, Ph.D. Thesis. Université Paris VI

3. On the theories of triangular sets;Aubry;Journal of Symbolic Computation,1999

4. The complexity of partial derivatives;Baur;Theoretical Computer Science,1983

5. Bershenko-Kogan, I., 2000. Inductive approach to Cartan’s moving frame method with applications to classical invariant theory, Ph.D. Thesis. University of Minesotta

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

1. Decomposition of Polynomial Ideals into Triangular Regular Sequences;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Elimination of unknowns for systems of algebraic differential-difference equations;Transactions of the American Mathematical Society;2020-10-14

3. Global Identifiability of Differential Models;Communications on Pure and Applied Mathematics;2020-06-17

4. Complexity of triangular representations of algebraic sets;Journal of Algebra;2019-04

5. Irredundant Triangular Decomposition;Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation;2018-07-11