| 
 | 
 
 
 楼主 |
发表于 2025-9-17 23:12
|
显示全部楼层
 
 
 
Set Theory and Logic 
Add to Mendeley Add to Citeulike Add to Facebook     
Logical Proof of the Millennium Puzzle P-vs-NP 
Authors: Yanhong Yang 
 
The existence of the premise: S=1,Then there is at least one P Problem(Computer-table problems)equal to NP problem (The solution is a computer-verifiable problem) then: P←→NP(P=NP). Thus, For all the class P and class NP problems,There are P=NP,also have P≠NP. 
 
Comments: 3 Pages. 
 
Download: PDF 
 
Submission history 
[v1] 2023-02-23 01:44:03 
Unique-IP document downloads: 236 times 
 
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website. 
 
Add your own feedback and questions here: 
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful. 
 
comments powered by Disqus 
Contact - Disclaimer - Privacy - Funding |   
 
 
 
 |