Re: P=NP Proof Published at CERN

On May 10, 10:40 pm, Martin Michael Musatov <marty.musa...@xxxxxxxxx>
wrote:
Answer me:> Denis wrote :





Martin Musatov a écrit :
An informal and highly experimental, unorthodox
proof P=NP has been
published on CERN preprints.

http://cdsweb.cern.ch/record/1164206/files/s1-ln575821

0-9223534-1939656818Hwf-1468147288IdV-1521282711575821

0PDF_HI0001.pdf

It is mine, and no it is not published anywhere
else. My purpose in
posting it here is for feedback and suggestions
on
how to strengthen
it.

I would specifically, as was my intention with
this
experiment, like
feedback from anyone interested in the
methodology
I used and
suggestion as to how I might go about pursuing a
more broadly accepted
peer-reviewed published proof building on this
basic result.

Dont worry : if you have really proved P=NP, any
working program solving
any NP-complete problem in polynomial time will be
enough to bring you
fame, the Clay prize money, and perhaps even
chicks...

Thank you,

Martin Musatov
m[dot]mm[at]vzw[dot]blackberry[dot]net.

Fool !

its just another crank , the reference to CERN only
makes its sad.

you wouldnt recognize a real crank , if he bites your
nose !

the P = NP proof is bogus !!

i cant believe mentioning CERN is enough to trick you
!

you still amaze me , but in a bad way !

cmon , JSH does better than that !

i hope no money was spent on that piece of crap ...

no regards

tommy1729

Who is "JSH"?--Martin Musatov
You still have not answered my question. Who is JSH and why do you
talk to me so poorly and with such anger?
.

Relevant Pages

  • Re: NP-complete and NP-Hard?
    ... >> polynomial time? ... > An NP-complete problem is a problem that is completely ... Jym. ... Prev by Date: ...
    (comp.theory)
  • If P==NP how to solve the Prime Factorization problem?
    ... I am looking for information on "if a polynomial time algorithm exists ... factorization ends up in P. ... for any other NP-Complete problem. ...
    (comp.theory)
  • Re: P = NP, background study?
    ... In response to Casey Hawthorne...it's already been proven that if you ... can solve one NP-complete problem in polynomial time, ... then there would be no NP-complete problem that is not solvable ... Or between discrete mathematics and flagrant mathematics. ...
    (comp.theory)
  • Re: NP completeness
    ... There is no NP-complete problem to which the answer is always "yes." ... solving some problem in propositional logic, ... you *think* you have a polynomial time algorithm to ... time algorithm that generates the solution to a NP-complete problem, ...
    (sci.math)