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

I shall describe a general model-theoretic task to construct expansions ofpseudofinite structures and discuss several examples of particular relevance tocomputational complexity. Then I will present one specific situation wherefinding a suitable expansion would imply that, assuming a one-way permutationexists, the computational class NP is not closed under complementation.

Expansions of pseudofinite structures and circuit and proof complexity