Re: P=NP

valls@xxxxxxxxxxx writes:
<snip>
I proved in 1985 that the UNIQUE polynomial over GF(2) that evaluates
always to 0 is the polynomial "0" (I am considering polynomials with
all the present variables with exponent 1, because over GF(2) we have
always X^2=X). Then, the algorithm that you are demanding is simply to
recognize if some polynomial over GF(2) is the "0" one or not, the
trivial algorithm that you are trying to understand.

Then I think you outlined the wrong thing. The heart of the proof is
then in the mapping that takes instances of SAT to polynomials that
are linear in all terms. That is the part to sketch out, and it is
that part that now sounds hard to me.

Of course, more
probably your real problem is to accept that such a trivial algorithm
resolves the P vs. NP problem!

No, the problem I had was exactly as I explained. I now have a new
problem. I can't see how the set of polynomials you are considering
is rich enough to represent SAT instances. Can you describe the
mapping?

<snip>
Of course, being published in a not wide-read journal is surely one of
the causes (not the unique!) to remain unnoticed for such a large
time. But now that I recently published it (June 2008) in a Journal of
my Institute, don't you think that it will convert that Journal in a
widely-read one?

Possibly. Someone who can review this material needs to read it first
though. What libraries carry it? I never can across your institute's
journal, and I pretty sure the library where I worked does not carry
it. The icmf.inf.cu website does not give any details of a Journal
and the bibliographic details you gave in your original post don't
give the name (and I can't search by ISSN). You don't make it easy to
find.

--
Ben.
.

Relevant Pages

  • Re: JSH: Somewhat puzzled
    ... > factoring polynomials, ... Tsk, tsk... ... If this technobabble of yours is 'a kick in the ego', ...
    (sci.math)
  • Re: Advice for math phD programs: give up abstact algebra
    ... your "criticism" had a place 200 years ... BEFORE abstract algebra came into place. ... your version of "history" is that polynomials made sense ...
    (sci.math)
  • Re: P=NP
    ... always to 0 is the polynomial "0" (I am considering polynomials with ... trivial algorithm that you are trying to understand. ...  What libraries carry it? ... and the bibliographic details you gave in your original post don't ...
    (comp.programming)
  • Re: JSH: Understanding the arguments
    ... and one of the f's equals 0 at x=0. ... which is trivially true when you have polynomials. ...
    (sci.math)
  • Re: Advice for math phD programs: give up abstact algebra
    ... I deny having made this because I didn't make it. ... elements of your ring A if you're interersted in some ring other than ... R) to polynomials. ...
    (sci.math)