Complexity bounds for zero-test algorithms

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".

• Type: Journal
• Year: 2006
• Where: JSC
• Authors: Joris van der Hoeven, John Shackell
• Keywords: Exponential Complexity Bound, Formal Power, JSC 2006, Power Series Analogue