Блог пользователя limed

Автор limed, история, 7 лет назад, По-английски

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.
  • Проголосовать: нравится
  • +92
  • Проголосовать: не нравится

»
7 лет назад, # |
  Проголосовать: нравится +64 Проголосовать: не нравится

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

»
7 лет назад, # |
  Проголосовать: нравится +2 Проголосовать: не нравится

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

»
7 лет назад, # |
  Проголосовать: нравится +53 Проголосовать: не нравится

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.

»
7 лет назад, # |
  Проголосовать: нравится +18 Проголосовать: не нравится

And it's wrong apparently?