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

Let G=(V,E) be a graph. Let k < |V| be an integer. Let O_k be the number ofedge induced subgraphs of G having k vertices and an odd number of edges. LetE_k be the number of edge induced subgraphs of G having k vertices and an evennumber of edges. Let D_k = O_k - E_k. The ODD EVEN DELTA problem consists incomputing D_k, given G and k. We show that such problem is #P-hard, even on3-regular bipartite planar graphs.

The ODD EVEN DELTA problem is #P-hard