Re: [PEPr] Call for votes on Math::Math_Polynomial
| From: | Etienne Kneuss | Date: | Sat, 19 Nov 2005 12:05:43 +0000 |
| Subject: | Re: [PEPr] Call for votes on Math::Math_Polynomial | ||
| References: | 1 | Groups: | php.pear.dev |
| Request: | Send a blank email to pear-dev+get-40426@lists.php.net to get a copy of this message | ||
Keith Palmer wrote:
>I'm also looking into algorithms to find the GCD of the polynomial, and polynomial
>factoring.
>
I don't think it will me possible without too much overhead.
Anyway, that might help you:
http://mathworld.wolfram.com/PolynomialFactorization.html
http://documents.wolfram.com/v4/MainBook/A.9.5.html
http://wseas.org/mastorakis/IEEE_CAS1_Jan.pdf
--
Etienne Kneuss
http://www.colder.ch/
colder@php.net