Full Disclosure mailing list archives

Re: Polynomials and factoring

From: Valdis.Kletnieks () vt edu
Date: Sun, 29 Apr 2007 11:24:32 -0400

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: _bin
Description:

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

Current thread:

Polynomials and factoring r ahead (Apr 28)
- Re: Polynomials and factoring Valdis . Kletnieks (Apr 29)