当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
The "cardinality of extended solution set" criterion for establishing the intractability of NP problems
arXiv - CS - Computational Complexity Pub Date : 2020-04-02 , DOI: arxiv-2004.01491
Arun U

The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually random (or whether it has some hidden undiscovered structure, which upon being detected would render it non-random). This has prevented the conclusive declaration of hard problems (such as NP) as being definitely intractable. For dealing with this, a concept called "extensibility" of a sequence is developed. Based on this, a criterion termed as "cardinality of extended solution set" is conceived to ascertain the (non)randomness of any sequence. Further, this can then be used to establish the (in)tractability of any problem depending on whether its solutions are random or non-random. This criterion is applied to problems such as 2-SAT, 3-SAT and hardness of approximation to analyze their (in)tractability. Finally, a proof for the validity of the Unique Games Conjecture based on the same criterion is also presented.
更新日期:2020-04-06

 

全部期刊列表>>
智控未来
聚焦商业经济政治法律
跟Nature、Science文章学绘图
控制与机器人
招募海内外科研人才,上自然官网
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
湖南大学化学化工学院刘松
上海有机所
李旸
南方科技大学
西湖大学
X-MOL
支志明
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug