Note for the Millennium Prize ProblemsEasyChair Preprint 11927, version historyVersion | Date | Pages | Version notes |
---|
1 | January 31, 2024 | 11 | | 2 | February 1, 2024 | 11 | We use the 1-in-3 3sat problem | 3 | February 2, 2024 | 11 | We created a Github repository with the software solution in Python | 4 | February 3, 2024 | 11 | We show that the Monotone Weighted Xor 2-satisfiability problem ($MWX2SAT$) is $NP$-complete and $P$ at the same time. | 5 | February 6, 2024 | 11 | | 6 | March 10, 2024 | 11 | We changed the abstract and content | 7 | March 14, 2024 | 12 | | 8 | March 15, 2024 | 11 | In the previous version, we create two ways to prove that MWX2SAT is in P. In this version, we remove the one that is flawed and we keep the correct and single one. | 9 | March 28, 2024 | 13 | Added the Discussion section | 10 | April 8, 2024 | 13 | We replaced in the definition of the K-CLOSURE the content "($u \in V'$ or $v \in V'$) or ($u \notin V'$ or $v \notin V'$)" by "($u \in V'$ and $v \in V'$) or ($u \notin V'$ and $v \notin V'$)" |
Keyphrases: Riemann hypothesis, complexity classes, computational complexity, elementary number theory, polynomial time, prime numbers |
|