Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article
Author

Andres Boldori

Department of Mathematics, University of Zurich, Zurich, Switzerland
1 article in our journals

Articles where this person is an author, newest first. People are matched by their name as printed (no ORCID iD is recorded for them), not by name alone; search the name as text to find namesakes too.

Research ArticleOpen accessp ≠ 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 PDFCite