Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JSC
2006

favoriteEmaildiscussreport

81views more JSC 2006»

Complexity bounds for zero-test algorithms

13 years 4 months ago

Complexity bounds for zero-test algorithms

Download www.texmacs.org

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

Joris van der Hoeven, John Shackell

Real-time Traffic

Exponential Complexity Bound | Formal Power | JSC 2006 | Power Series Analogue |

claim paper

Related Content

» Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

» Rademacher Complexities and Bounding the Excess Risk in Active Learning

» The Uniformity Conjecture

» A NearTight Lower Bound on the Time Complexity of Distributed MinimumWeight Spanning Tree ...

» On the Decoding Complexity of Cyclic Codes Up to the BCH Bound

» Complexity Bounds for Batch Active Learning in Classification

» The Partition Bound for Classical Communication Complexity and Query Complexity

» Property Testing Lower Bounds via Communication Complexity

» The Complexity of Integer Bound Propagation

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JSC
Authors	Joris van der Hoeven, John Shackell

Comments (0)