@article{vanderHoevenShackell:JSC:2006,
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''.},
Author = {{van der Hoeven}, Joris and Shackell, John},
File = {Complexity bounds for zero-test algorithms - 1-s2.0-S0747717106000459-main - a.pdf},
ISSN = {0747-7171},
Journal = {Journal of Symbolic Computation},
Keywords = {Zero-test, Power series, Complexity, Pfaffian series, Witness conjecture},
Number = {9},
Pages = {1004--1020},
Title = {Complexity bounds for zero-test algorithms},
URL = {https://www.sciencedirect.com/science/article/pii/S0747717106000459},
Volume = {41},
Year = {2006},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0747717106000459},
bdsk-url-2 = {https://doi.org/10.1016/j.jsc.2006.06.001},
date-added = {2023-02-02 19:57:46 +0100},
date-modified = {2023-02-02 20:19:11 +0100},
doi = {10.1016/j.jsc.2006.06.001}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A