Re: P = NP!

Yaakov Davis ...
I'm very excited to announce that I've managed to
develop a polynomial time algorithm for solving
the SAT problem, therefore proving P = NP.

Newbie ...
Why you don't use your algorithm to solve some
hard problem? ... convert instances of FACTORING
into istances of SAT.

Various Patent offices around the world now insist
that the inventors of perpetual motion devices and
inertial drive devices produce a demonstration of
their device before even bothering to examine the
application. Claims of polynomial algorithms for
NP problems should demonstrate their algorithms on
known hard instances.

The OP's reluctance to address this point suggests
that their method simply doesn't work. Even an
inefficient implementation will show the correct
growth of solution time with instance size, giving
confidence that there's something in the claim.

Without such a demonstration, the over-whelmingly
large probability is that it just doesn't work.

The OP suggests we try the algorithm for ourselves.
He's the one in line to win the $1m, why doesn't he
do it?

But remember, almost every (in the technical sense)
instance of most NP problems are easy. Use a known
hard instance. Factoring is a good one, even though
it's not NPC.
.

Relevant Pages

  • beta version of Victor Shoups book, "A Computational Introduction to Number Theory and Algebra&
    ... Computing with Large Integers ... The Basic Euclidean Algorithm ... Factoring and Computing Euler's phi-Function are Equivalent ... The Existence of Finite Fields ...
    (sci.crypt)
  • Re: Ultimate check, new way to factor or not?
    ... It's commonly known as a the "factoring sieve" and Fermat showed that ... It is listed as "algorithm ... "factoring with sieves" on pp.389. ... > when it defies the mathematics. ...
    (sci.crypt)
  • Re: I was right, surrogate factoring proof
    ... primes divide n -- at most I'll have to look through sqrt/ ... But don't forget that's included in the cost of the algorithm! ... if surrogate factoring ever becomes ... two values are congruent modulo p, and hopefully not congruent modulo n/p. ...
    (sci.math)
  • Re: I was right, surrogate factoring proof
    ... primes divide n -- at most I'll have to look through sqrt/ ... But don't forget that's included in the cost of the algorithm! ... if surrogate factoring ever becomes ... two values are congruent modulo p, and hopefully not congruent modulo n/p. ...
    (sci.crypt)
  • Re: More math stuff, truth and social reality
    ... > out that I use brainstorming, where you generate lots of ideas during ... fast as other efficient factoring algorithms. ... I don't see evidence of lying, ... algorithm) is in fact the truth. ...
    (sci.math)