Factoring polynomials over global fields
| dc.creator | Belabas, K. | |
| dc.creator | van Hoeij, M. | |
| dc.creator | Klueners, J. | |
| dc.creator | Steel, A. | |
| dc.date | 2004-09-27 | |
| dc.date.accessioned | 2026-07-07T05:12:36Z | |
| dc.date.available | 2026-07-07T05:12:36Z | |
| dc.description | Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/math/0409510 | |
| dc.identifier | http://arxiv.org/abs/math/0409510 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72635 | |
| dc.subject | Number Theory | |
| dc.subject | 11Y16 | |
| dc.title | Factoring polynomials over global fields | |
| dc.type | text |