2013
DOI: 10.1142/s0129626413500072
|View full text |Cite
|
Sign up to set email alerts
|

Inductive Complexity of the P Versus Np Problem

Abstract: This paper does not propose a solution, not even a new possible attack, to the P versus NP problem. We are asking the simpler question: How "complex" is the P versus NP problem? Using the inductive complexity measure-a measure based on computations run by inductive register machines of various orders-developed in [2], we determine an upper bound on the inductive complexity of second order of the P versus NP problem. From this point of view, the P versus NP problem is significantly more complex than the Riemann… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 15 publications
(30 reference statements)
0
1
0
Order By: Relevance
“…In cloud computing, the problem of task scheduling has become a hot issue. At the same time, it is also a NP hard problem [3,4].…”
Section: Introductionmentioning
confidence: 99%
“…In cloud computing, the problem of task scheduling has become a hot issue. At the same time, it is also a NP hard problem [3,4].…”
Section: Introductionmentioning
confidence: 99%