Name
Abstract | ||
|---|---|---|
The problem of factorising polynomials: that is to say, given a polynomial with integer coefficients, to find the irreducible polynomials that divide it, is one with a long history. While the last word has not been said on the subject, we can say that the past 15 years have seen major break-throughs, and many computer algebra systems now include efficient algorithms for this problem. When it comes to polynomials with algebraic number coefficients, the problem is far harder, and several major questions remain to be answered. Nevertheless, the last few years have seen substantial improvements, and such factorisations are now possible. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/3-540-18928-9_6 | Trends in Computer Algebra |
Keywords | Field | DocType |
old ideas,old idea,recent result,recent results,irreducible polynomial | Integer,Discrete mathematics,Algebraic number,Polynomial,Algebra,Symbolic computation,Factorization,Mathematics | Conference |
Volume | ISSN | ISBN |
296 | 0302-9743 | 0-387-18928-9 |
Citations | PageRank | References |
2 | 1.19 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. A. Abbott | 1 | 15 | 5.18 |
| Russell J. Bradford | 2 | 255 | 25.29 |
| J. H. Davenport | 3 | 109 | 21.82 |