Re: Complexity of Polynomial Factorization
- From: esarad@xxxxxxxxx
- Date: 17 Mar 2006 21:27:29 -0800
Berlekamp factoring,Benor and Cantor Zassenhaus are some polynomial
factoring algorithms.
Look at Shoup's book
http://shoup.net/ntb/
.
- References:
- Complexity of Polynomial Factorization
- From: Domagoj Babic
- Re: Complexity of Polynomial Factorization
- From: Domagoj Babic
- Complexity of Polynomial Factorization
- Prev by Date: Re: February articles on scientificcomputing.blogspot.com
- Next by Date: Math2Max.pl
- Previous by thread: Re: Complexity of Polynomial Factorization
- Next by thread: [MuPad] jumping to placeholder in Word AddIn
- Index(es):
