English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this note, we extend the result of \cite{PoulyG16} about the complexity ofsolving polynomial differential equations over unbounded domains to work withnon-rational input. In order to deal with arbitrary input, we phrase the resultin framework of Conputable Analysis \cite{Ko91}. As a side result, we also geta uniform result about complexity of the operator, and not just about thesolution.

Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients