Is the proof of P != NP by Ke Xu and Guangyan Zhou valid?
140
1.3kṀ350k
resolved Apr 15
Resolved
NO

https://arxiv.org/abs/2302.09512

Resolves once either of the following are true:

  • There's an easily accessible and broadly accepted consensus on the subject, such as Wikipedia providing an answer.

  • Scott Aaronson or some other well-known and respected computational complexity person states it is or isn't valid, and there doesn't seem to be significant disagreement from any other well-known and respected computational complexity people.

Get
Ṁ1,000
to start trading!

🏅 Top traders

#NameTotal profit
1Ṁ3,285
2Ṁ1,909
3Ṁ1,806
4Ṁ1,458
5Ṁ1,293
© Manifold Markets, Inc.TermsPrivacy