Search | Science Publications

Research ArticleOpen accessIn the keywordsp ≠ np: The Set of Deterministic Problems that are Solvable in Polynomial Time is Unequal to the Set of Non-Deterministic Problems that are Solvable in Polynomial TimeAndres BoldoriThis study constructs a solution to the “p vs. np” problem using complexity theory. We show through counterexamples that p ≠ np and formalize the two sets using stochastic, probabilistic and non-deterministic modeling. While the well-known sets “pspace” and “npspace”, analyzing the storage of a device, can be claimed to be equal, p and np differ and are exclusively defined … …Journal of Computer Science, Vol. 20, Issue 10 · 8 Aug 2024 · 7,106 accessesView PDF Cite

1 article for “Exponential Runtime”