[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Full-disclosure] Polynomials and factoring



On Sat, 28 Apr 2007 13:16:28 +0300, r ahead said:

> It would be nice if nilpotent elements were efficiently
> computable - Mod(y,y^k) may find the degree of the lowest
> monomial, but k is large.

Yes, it would be nice.  However, wishing doesn't make it so.

http://www.scienceteecher.com/miracle.htm

That's where you're sitting right now.

Attachment: pgp344QZNj4el.pgp
Description: PGP signature

_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/