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/

Zendy Plus

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

Zendy Tools

Zendy Open

In this paper we present a new path order for rewrite systems, theexponential path order EPOSTAR. Suppose a term rewrite system is compatiblewith EPOSTAR, then the runtime complexity of this rewrite system is boundedfrom above by an exponential function. Furthermore, the class of functioncomputed by a rewrite system compatible with EPOSTAR equals the class offunctions computable in exponential time on a Turing maschine.

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)