Is the proof of P != NP by Ke Xu and Guangyan Zhou valid?
140
1.3kṀ350kresolved Apr 15
Resolved
NO1H
6H
1D
1W
1M
ALL
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.
This question is managed and resolved by Manifold.
Get
1,000 to start trading!
🏅 Top traders
# | Name | Total profit |
---|---|---|
1 | Ṁ3,285 | |
2 | Ṁ1,909 | |
3 | Ṁ1,806 | |
4 | Ṁ1,458 | |
5 | Ṁ1,293 |