(fixed) P vs NP: my proof of P != NP
From: Mikhail N. Kupchik (mikhkup_at_mail.ru)
Date: 04/13/04
- Previous message: Stephan Schulz: "Re: name for a small variation of the quicksort"
- Next in thread: Mikhail N. Kupchik: "Re: (fixed) P vs NP: my proof of P != NP"
- Reply: Mikhail N. Kupchik: "Re: (fixed) P vs NP: my proof of P != NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 13 Apr 2004 21:23:16 +0300
Hi All.
After some discussion with David Moews we come to conclusion that my
original proof was wrong, the crux was last step in penultimate theorem;
actually original claim of that theorem is wrong.
Fortunately the problem can be easily avoided.
The link to updated version is
http://users.i.com.ua/~zkup/pvsnp_en_002.pdf .
To people who have already read the first (wrong) version:
I've changed only a few things. Look at definition 2 and theorem 5 at
page 14 and end of the proof of theorem 6 at page 18-19 (last step was
simply cut). (Note that theorem numbers were changed somewhere).
-- Mikhail Kupchik
- Previous message: Stephan Schulz: "Re: name for a small variation of the quicksort"
- Next in thread: Mikhail N. Kupchik: "Re: (fixed) P vs NP: my proof of P != NP"
- Reply: Mikhail N. Kupchik: "Re: (fixed) P vs NP: my proof of P != NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]