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

We prove that the word problem of the Brin-Thompson group nV over a finitegenerating set is coNP-complete for every n \ge 2. It is known that the groupsnV are an infinite family of infinite, finitely presented, simple groups. Wealso prove that the word problem of the Thompson group V over a certaininfinite set of generators, related to boolean circuits, is coNP-complete.

The word problem of the Brin-Thompson group is coNP-complete