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 demonstrate a polynomial approach to express the decision version of thedirected Hamiltonian Cycle Problem (HCP), which is NP-Complete, as theSolvability of a Polynomial Equation with a constant number of variables,within a bounded real space. We first introduce four new Theorems for a set ofperiodic Functions with irrational periods, based on which we then use atrigonometric substitution, to show how the HCP can be expressed as theSolvability of a single polynomial Equation with a constant number ofvariables. The feasible solution of each of these variables is bounded withintwo real numbers. We point out what future work is necessary to prove thatP=NP.

Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation