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

We show that the affirmation $P\subseteq NP$ (in computer science)erroneously and we prove the justice of the hypotesis J.Edmonds's $P\neq NP$.We show further that all the $NP$-complete problems is not polynomial and wegive the classification of the problems with the polynomial certificates.

Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates