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

In this short note, we show that the problem of computing the recursiveteaching dimension (RTD) for a concept class (given explicitly as input)requires $n^{\Omega(\log n)}$-time, assuming the exponential time hypothesis(ETH). This matches the running time $n^{O(\log n)}$ of the brute-forcealgorithm for the problem.

A Note on Hardness of Computing Recursive Teaching Dimension