Dear friends,
I believe there is a separate group focussing on solving all the problems as
given in donald knuths' AOCP. Please let me know if there is any such thing.
regards,
sudarshan
well thats a theoretical result.. "Primes is in P"
its not of any practical significance atleast as of today.
anyone interested in cryptography here? please let me know.
regards,
sudarshan
- Original Message -
From: "Peyman" <[EMAIL PROTECTED]>
To: "Algorithm Geeks"
Sent: Monday, J
there is this very nice yahoogroup called theory-edge
http://groups.yahoo.com/group/theory-edge
You can try your hands there... that would be more an approriate group to
post this kinda questions.
best,
sudarshan
- Original Message -
From: "Protoman" <[EMAIL PROTECTED]>
To: "Algo
.iitk.ac.in/users/manindra/primality_original.pdf
Also read the last paragraph on this link:
http://www.guajara.com/wiki/en/wikipedia/c/co/co_np.html
-Dhyanesh
On 11/30/05, SUDARSHAN IYENGAR <[EMAIL PROTECTED]> wrote:
>
> factoring is an np complete problem. No change of having a sim
ve there is an N^12 algorithm for integer factorization ... so
it isnt all that hard i think ...
On 11/29/05, SUDARSHAN IYENGAR <[EMAIL PROTECTED]> wrote:
>
> primality testing is a very very very tough topic to discuss...
>
>
> There is no single algorithm for primality test
ous Prime number?
thanks for the info
but i am looking into the logic of finding the previous prime number...
On 11/29/05, SUDARSHAN IYENGAR <[EMAIL PROTECTED]> wrote:
>
>
> hey well... you must have a look at this package "pari gp"
>
> try googling and you can d
hey well... you must have a look at this package "pari gp"
try googling and you can download this package, its very small and is the
best of its kind available till date... You can also get the code for the
same...
-Sudarshan
- Original Message -
From: <[EMAIL PROTECTED]>
To: "Algorith
