Article thumbnail
Location of Repository

Complexity bounds for zero-test algorithms

By Joris van der Hoeven and John Shackell

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"

Topics: QA
Publisher: Academic Press Ltd
Year: 2006
OAI identifier: oai:kar.kent.ac.uk:6364
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1016/j.js... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.