On the complexity of the resolvent representation of some prime differential ideals

DOI10.1016/j.jco.2005.10.002zbMath1155.12004OpenAlexW2104965505MaRDI QIDQ2496182

Pablo Solernó, Gabriela Jeronimo, Lisi D'Alfonso

Publication date: 12 July 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2005.10.002

zbMATH Keywords

elimination theoryprobabilistic algorithmsstraight-line programsdifferential algebraresolvent representationdifferential Hilbert function

Mathematics Subject Classification ID

Related Items (8)

Quantitative aspects of the generalized differential Lüroth's theorem ⋮ Effective differential Lüroth's theorem ⋮ Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages ⋮ Weak identifiability for differential algebraic systems ⋮ A bound for orders in differential Nullstellensatz ⋮ Probabilistic algorithms for computing resolvent representations of regular differential ideals ⋮ A geometric index reduction method for implicit systems of differential algebraic equations ⋮ A linear algebra approach to the differentiation index of generic DAE systems

Uses Software

• Kronecker
• ObservabilityTest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability and fast quantifier elimination in algebraically closed fields
• Lower bounds for diophantine approximations
• Resolvent representation for regular differential ideals
• Computing parametric geometric resolutions
• Sharp estimates for the arithmetic Nullstellensatz
• Fast computation of discrete invariants associated to a differential rational mapping
• A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
• Deformation techniques for efficient polynomial equation solving.
• Associative differential operations
• Some Basic Theorems in Partial Differential Algebra
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Some Basic Theorems in Differential Algebra (Characteristic p, Arbitrary)
• A probabilistic algorithm to test local algebraic observability in polynomial time
• Algorithms in real algebraic geometry
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving

This page was built for publication: On the complexity of the resolvent representation of some prime differential ideals