Re: Proof factoring solution is closed form

From: Larry Lard (larrylard_at_hotmail.com)
Date: 02/09/05 

Date: 9 Feb 2005 05:50:53 -0800

jstevh@msn.com wrote:
> Rick Decker wrote:
> > jstevh@msn.com wrote:
[snip]
> > > And that's a polynomial time problem, as the equation defining
how
> many
> > > combinations of those factors there are is a polynomial one.
> > >
> > That's not what we mean by a poly-time solution. In fact, one might
> > have to search for factors in a space that could be about as large
as
> M
> > itself. If you're going to get a poly-time solution, you'll at
least
> > have to cut down the search to O((log M)^k), for some fixed k.
> >
>
> Why?
>
> You aren't giving any information here, but just assertions without
> explanation.

No, he's giving you *definitions*. He's pointing out that the meaning
you've ascribed to 'polynomial time' differs from the definition used
by EVERYONE ELSE IN THE WORLD. You have in the past claimed to be a
professional programmer; the fact that you appear not to know what
'polynomial time' means is... well, I was going to say surprising, but
really, demonstrations of your ignorance no longer surprise. 

-- 
Larry Lard
Replies to group please

Relevant Pages