文章基本信息

标题：P VS NP PROBLEM
本地全文：下载
作者：Shivam Sharma
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2015
卷号：6
期号：6
页码：5022-5025
出版社：TechScience Publications
摘要：This paper deals with the most recent development that have took place to solve P vs NP problem. We will look into different ways which have tried to give a solution to this problem. The paper includes the proof complexity and various other aspects which enlightens the research that have taken place in the field so far. With a deep and thorough analysis of various works by different authors around the world, it can be concluded that the problem is still unresolved but there is a lot of scope still left to explore which requires further research.
关键词：Clique; cloning; brute force.