This paper is published in Volume-6, Issue-4, 2020
Area
Computer Science And Mathematics
Author
Swostik Pati
Org/Univ
Delhi Public School, Navi Mumbai, Maharashtra, India
Keywords
Polynomial Time, Computational Complexity, Non-Deterministic And Deterministic Algorithms, Conjecture
Citations
IEEE
Swostik Pati. P VERSUS NP PARADOX, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.
APA
Swostik Pati (2020). P VERSUS NP PARADOX. International Journal of Advance Research, Ideas and Innovations in Technology, 6(4) www.IJARIIT.com.
MLA
Swostik Pati. "P VERSUS NP PARADOX." International Journal of Advance Research, Ideas and Innovations in Technology 6.4 (2020). www.IJARIIT.com.
Swostik Pati. P VERSUS NP PARADOX, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.
APA
Swostik Pati (2020). P VERSUS NP PARADOX. International Journal of Advance Research, Ideas and Innovations in Technology, 6(4) www.IJARIIT.com.
MLA
Swostik Pati. "P VERSUS NP PARADOX." International Journal of Advance Research, Ideas and Innovations in Technology 6.4 (2020). www.IJARIIT.com.
Abstract
The P vs. NP problem has haunted scientists’ minds for years. It is considered to be one of the most difficult and deepest unanswered questions in the field of computer science and mathematics. Intellectuals all over the world have tried to reach a possible solution for years but there still isn’t any consensus regarding the same. In this article, we will try to revisit the problem and discuss it using layman examples. I will touch all major aspects of computer science and mathematics related to the problem. Finally, I will conclude by providing a paradox that will cause people to think in a completely different way towards the possibility of a solution to the problem.
