Thought this would be interesting to many: https://arxiv.org/abs/1708.03486

```
Norbert Blum
(Submitted on 11 Aug 2017)
Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreevs function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP.
```

I can't say the proof is correct or flawed, but there is a page with lots of proofs that P = NP and that P != NP here if it may be interesting to anyone

Really a big new, hope it can pass through the peer review and the author can get Turing Award.

To be honest, "The Conceptual Penis as a Social Construct" also passed peer review :D

I think babin's proof for P != NP is the shortest and the simplest. Here is the complete proof:

Suppose by contradiction that P = NP, then by basic algebra if we reduce P we obtain N = 1 for every N integer which is clearly a contradiction thus the proof is complete.

It's wrong if P=0, world rescued

babin, what do you say about it?

Obviously P!=0 since it stands for Positive :)

Alternative argument :

P is a polynomial complexity , if it was 0, it would have been constant( O(1) ), which is not polynomial complexity, therefore P != 0 and the proof is correct, where is my 1kk ?

Actually, at least in some definitions

f(x) = 1isa polynomial of degree 0.Also,

O(1) is a subset ofO(N).So many wrong proofs nowadays...

And it's wrong apparently?