Re: Basically a sieve method, relation to quantum

From: Mark Nudelman (markn_at_greenwoodsoftware.com)
Date: 01/23/05 

Date: Sun, 23 Jan 2005 09:42:55 -0800

jstevh@msn.com wrote:
> Mark Nudelman wrote:
>> jstevh@msn.com wrote:
>>> The original algorithm in my program, will, my current analysis
>>> shows, factor about 50% of the time, which is astounding.
>>
>> I'm not sure why that's astounding. There are lots of algorithms
>> that factor numbers 100% of the time.
>>
>
> Yeah but my algorithm does it in polynomial time.

I must have missed your proof that your algorithm works in polynomial time.
Obviously this is the crucial point. Could you repeat that argument, or
point me to a reference?

--Mark

Relevant Pages

  • 6P=NP: Proof: Nondeterministic Algorithm
    ... each time the algorithm is run the resulting guess may differ. ... be done in Oor polynomial time. ... verifies x if there exists a certificate y such ... Algorithm A verifies language L if for any string x Î ...
    (sci.math)
  • Re: Aspiring highest-order programmer
    ... > that today's programmers repeat the mistakes of the past because their ... not the algorithm choosen to solve it. ... it means that there is no known polynomial time algorithm to ... algorithm to solve any NP-complete problem, ...
    (comp.programming)
  • Re: JSH: Nearly done
    ... my response to your "polynomial time" below.) ... algorithms really are, so I'll tell you: For a factoring algorithm to ... it doesn't hurt to use recursion in a "proof of concept" ...
    (sci.math)
  • Re: Can EXPTIME and NP be separated via diagonalization?
    ... where M is a Turing machine and p is a polynomial ... can be done in polynomial time. ... How do we verify that the algorithm we've found solves SAT? ... Consider, for a fixed integer k, the decision problem ALGSAT-k. ...
    (comp.theory)
  • Re: New algorithm for the isomorphism of graphs
    ... complicated algorithm works better (avoids backtracking entirely, ... indexed variable, assigning a value to a variable, or comparing two ... so, once you "big O" it, you end up with a running time of 1. ... in polynomial time. ...
    (sci.math)