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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We show that the computational complexity of Riemann mappings can be boundedby the complexity needed to compute conformal mappings locally at boundarypoints. As a consequence we get first formally proven upper bounds forSchwarz-Christoffel mappings and, more generally, Riemann mappings of domainswith piecewise analytic boundaries.

A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)