Abstract
Using the complexity measure developed in [7,3,4] and the extensions obtained by using inductive register machines of various orders in [1,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 more complex than the Riemann hypothesis. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Calude, C. S., Calude, E., & Queen, M. S. (2012). Inductive complexity of P versus NP problem: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7445 LNCS, pp. 2–9). https://doi.org/10.1007/978-3-642-32894-7_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
