Complexity of quantifier elimination in the theory of ordinary differential equations

Bounds on numers of vectors of multiplicities for polynomials which are easy to compute

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

Circuits versus Trees in Algebraic Complexity

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Cited References

Computer algebra handbook

Resolvent systems of difference polynomial ideals

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

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

Journal of Complexity

An upper bound for minimizing coefficients of dimension Kolchin polynomial

Programming and Computing Software

On computing absolutely irreducible components of algebraic varieties with parameters

Computing

Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models

Electronic Notes in Theoretical Computer Science (ENTCS)