Complexity bounds for zero-test algorithms

• Autores: John Shackell, Joris van der Hoeven
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 9, 2006, págs. 1004-1020
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract In this paper, we analyze the complexity of a zero-test for expressions built from formal power series solutions of first order differential equations with non-degenerate initial conditions. We will prove a doubly exponential complexity bound. This bound establishes a power series analogue for ¿witness conjectures¿.