Probabilistic algorithms for computing resolvent representations of regular differential ideals
From MaRDI portal
Publication:985372
Recommendations
- On the complexity of the resolvent representation of some prime differential ideals
- Resolvent representation for regular differential ideals
- scientific article; zbMATH DE number 1254247
- Computing canonical representatives of regular differential ideals
- Computing representations for radicals of finitely generated differential ideals
Cites work
- scientific article; zbMATH DE number 1185962 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1263403 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 3207354 (Why is no real title available?)
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- scientific article; zbMATH DE number 3056446 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A Simple Algorithm for Cyclic Vectors
- A bound for the Rosenfeld-Gröbner algorithm
- A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
- Algebraic transformation of differential characteristic decompositions from one ranking to another
- Automated reasoning in differential geometry and mechanics using the characteristic set method. I: An improved version of Ritt-Wu's decomposition algorithm
- Computing representations for radicals of finitely generated differential ideals
- Definability and fast quantifier elimination in algebraically closed fields
- Essential components of an algebraic differential equation
- Factorization-free decomposition algorithms in differential algebra
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Formal Solutions of Irregular Linear Differential Equations. Part II
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Modern computer algebra
- On the complexity of the resolvent representation of some prime differential ideals
- On the theories of triangular sets
- Resolvent representation for regular differential ideals
- Resolvent systems of difference polynomial ideals
- Solving zero-dimensional systems through the rational univariate representation
- Some Basic Theorems in Differential Algebra (Characteristic p, Arbitrary)
- Specializations in Differential Algebra
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
Cited in
(5)- A primitive element theorem for fields with commuting derivations and automorphisms
- Resolvent representation for regular differential ideals
- On the complexity of the resolvent representation of some prime differential ideals
- A new algorithm for computing regular representations for radicals of parametric differential ideals
- A geometric index reduction method for implicit systems of differential algebraic equations
This page was built for publication: Probabilistic algorithms for computing resolvent representations of regular differential ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985372)
