Fast algorithms for monomial janet(-like) bases
From MaRDI portal
Cites work
- A new algorithm for computing staggered linear bases
- Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets
- Bar code and Janet-like division
- Combinatorial Commutative Algebra
- Complementary decompositions of monomial ideals and involutive bases
- Computer Algebra in Scientific Computing
- scientific article; zbMATH DE number 1684370 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 5052246 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Involution. The formal theory of differential equations and its applications in computer algebra
- Involutive bases of polynomial ideals
- Janet bases and resolutions in \textsc{CoCoALib}
- Leçons sur les systèmes d'équations aux dérivées partielles.
- Minimal involutive bases
- Random monomial ideals
- Recursive structures in involutive bases theory
- Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
- Some complexity results for polynomial ideals
- Sur les systèmes d'équations aux dérivées partielles.
This page was built for publication: Fast algorithms for monomial janet(-like) bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397185)
