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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let  F  be a (possibly non-simple) hypergraph and let  forb( m ,  F )  denote the maximum number of edges a simple hypergraph with  m  vertices can have if it doesn’t contain  F  as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of  forb( m ,  F )  for fixed  F . In this paper we prove that even finding this predicted asymptotic behaviour is an NP-hard problem, meaning that if the Anstee-Sali conjecture were true, finding the asymptotics of  forb( m ,  F )  would be NP-hard.

Forbidden configurations: Finding the number predicted by the Anstee-Sali conjecture is NP-hard