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

The main achievement of this thesis is an algorithm which given a finitegroup presentation and natural numbers n and k, computes all the relators oflength and area up to n and k respectively. The complexity of this algorithm isbetter by a factor which is over-exponential than that of classical methodsusing van Kampen diagrams.

Algorithmic and combinatorial methods for enumerating the relators of a group presentation