On Correlation of Р And NP Classes | Zendy

Listrovoy Sergey Vladimirovich | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Correlation of Р And NP Classes

Author(s) -

Listrovoy Sergey Vladimirovich

Publication year - 2012

Publication title -

international journal of modern education and computer science

Language(s) - English

Resource type - Journals

eISSN - 2075-017X

pISSN - 2075-0161

DOI - 10.5815/ijmecs.2012.03.03

Subject(s) - satisfiability , computer science , class (philosophy) , boolean satisfiability problem , np complete , correlation , computational complexity theory , discrete mathematics , theoretical computer science , algorithm , mathematics , artificial intelligence , geometry

It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook's S.А. theorem on that the "satisfiability" problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NP- complete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research