[prev in list] [next in list] [prev in thread] [next in thread] 

List:       full-disclosure
Subject:    Re: [Full-disclosure] Polynomials and factoring
From:       Valdis.Kletnieks () vt ! edu
Date:       2007-04-29 15:24:32
Message-ID: 15653.1177860272 () turing-police ! cc ! vt ! edu
[Download RAW message or body]

[Attachment #2 (multipart/signed)]


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 #5 (application/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/

[prev in list] [next in list] [prev in thread] [next in thread]