Loading...
Please wait, while we are loading the content...
Similar Documents
A fast algorithm for polynomial factorization over Q
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ford, David A. Pauli, Sebastian Roblot, Xavier-François |
| Copyright Year | 1994 |
| Abstract | We present an algorithm that returns a proper factor of a polynomial Φ(x) over the p-adic integers Zp (if Φ(x) is reducible over Qp) or returns a power basis of the ring of integers of Qp[x]/Φ(x)Qp[x] (if Φ(x) is irreducible over Qp). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.math.tu-berlin.de/~kant/publications/papers/fapfbdx.ps.gz |
| Alternate Webpage(s) | http://math.univ-lyon1.fr/~roblot/resources/newround4.pdf |
| Alternate Webpage(s) | http://archive.numdam.org/article/JTNB_2002__14_1_151_0.pdf |
| Alternate Webpage(s) | http://hal.inria.fr/docs/00/86/30/82/PDF/newround4.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
