Re: Simple integer factorization algorithm
- From: Patricia Shanahan <pats@xxxxxxx>
- Date: Sat, 29 Nov 2008 08:08:31 -0800
Joshua Cranmer wrote:
JSH wrote:I simply prefer Java, that's all. If it's terribly off-topic to give
a coding opportunity here, I so apologize.
Yes, it is off-topic here. This is not an advertising board.
I think it could be made on-topic by JSH presenting, rather than a vague
description of his idea and some claims, a specification of a program he
would like written in Java. Despite temptation, I accept that the
correctness and complexity of the algorithm are off-topic here, and will
not discuss them. Hint: I do read comp.theory, where the correctness and
complexity of a proposed algorithm would be on-topic.
To make this implementable, the pieces of his algorithm that he glosses
over would have to be filled in. For example, at the start he needs to
find a couple of numbers satisfying some constraints. Presumably, JSH
knows the polynomial time algorithms he intends to use to find those
numbers. The specification should include those algorithms, or
references to places where they are written up.
The whole algorithm should be described in either pseudo-code or links
to web pages containing pseudo-code.
Patricia
.
- Follow-Ups:
- References:
- Simple integer factorization algorithm
- From: JSH
- Re: Simple integer factorization algorithm
- From: Joshua Cranmer
- Re: Simple integer factorization algorithm
- From: JSH
- Re: Simple integer factorization algorithm
- From: Joshua Cranmer
- Simple integer factorization algorithm
- Prev by Date: Re: Netbeans failure mode
- Next by Date: Re: Generics, for non collection types
- Previous by thread: Re: Simple integer factorization algorithm
- Next by thread: Re: Simple integer factorization algorithm
- Index(es):
Relevant Pages
|
