Title of article
Complexity bounds for zero-test algorithms
Author/Authors
Joris van der Hoeven، نويسنده , , John Shackell، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
17
From page
1004
To page
1020
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”.
Keywords
Power series , complexity , Witness conjecture , Pfaffian series , Zero-test
Journal title
Journal of Symbolic Computation
Serial Year
2006
Journal title
Journal of Symbolic Computation
Record number
805956
Link To Document