van der Hoeven, Joris, Shackell, John (2006) Complexity bounds for zero-test algorithms. Journal of Symbolic Computation, 41 (9). pp. 1004-1020. ISSN 0747-7171. (doi:10.1016/j.jsc.2006.06.001) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:6364)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://dx.doi.org/10.1016/j.jsc.2006.06.001 |
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".
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1016/j.jsc.2006.06.001 |
| Subjects: | Q Science > QA Mathematics (inc Computing science) |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science |
| Depositing User: | Judith Broom |
| Date Deposited: | 05 Sep 2008 05:43 UTC |
| Last Modified: | 16 Nov 2021 09:44 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/6364 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
