This paper is published in Volume-7, Issue-2, 2021
Area
Computer Engineering
Author
Sanket Kulkarni
Org/Univ
Independent Researcher, India
Pub. Date
20 April, 2021
Paper ID
V7I2-1406
Publisher
IJARIIT
Edition
Volume-7, Issue-2, 2021
Keywords
P vs NP, Subset Sum, Algorithm

Citationsacebook

IEEE
Sanket Kulkarni. Proof of P=NP, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

APA
Sanket Kulkarni (2021). Proof of P=NP. International Journal of Advance Research, Ideas and Innovations in Technology, 7(2) www.IJARIIT.com.

MLA
Sanket Kulkarni. "Proof of P=NP." International Journal of Advance Research, Ideas and Innovations in Technology 7.2 (2021). www.IJARIIT.com.

Give proper credits, use Citation.

Abstract

The aim of this work is to find subsets of an array whose sum is K in polynomial time and hence to provide proof of P=NP

All content is copyright protected.