On the complexity of the resolvent representation of some prime differential ideals
Authors:
- Lisi D’alfonsoLDLisi D’alfonso
- Gabriela JeronimoGJGabriela Jeronimo
- Pablo SolernóPSPablo Solernó
- 1 June 2006
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 22 (3) , 396-430
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Resolvent Representation for Regular Differential IdealsApplicable Algebra in Engineering, Communication and Computing, 2003
- Algorithms in Real Algebraic Geometry2003
- A Gröbner Free Alternative for Polynomial System SolvingJournal of Complexity, 2001
- Deformation Techniques for Efficient Polynomial Equation SolvingJournal of Complexity, 2000
- Lower bounds for diophantine approximationsJournal of Pure and Applied Algebra, 1997
- Algebraic Complexity Theory1997
- Index and Decomposition of Nonlinear Implicit Differential EquationsIFAC Proceedings Volumes, 1995
- When polynomial equation systems can be “solved” fast?Lecture Notes in Computer Science, 1995
- Complexity of quantifier elimination in the theory of ordinary differential equationsLecture Notes in Computer Science, 1989
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983