Feature #44
Feature #39: Squarefree factorization
Feature #43: Squarefree factorization - for polynomials
Squarefree factorization - univariate polynomials
Status:
Closed
Priority:
Normal
Assignee:
Category:
New Function
Target version:
Start date:
30 Nov 2011
Due date:
% Done:
100%
Estimated time:
(Total: 0.00 h)
Spent time:
0.10 h (Total: 0.80 h)
Description
For the case of sqfr factorization of univariate polynomials, it is easy to obtain the coarsest sqfr factorization.
Subtasks
History
#1 Updated by John Abbott over 10 years ago
- Status changed from New to Closed
- Assignee set to John Abbott
The multivariate code (port of d'Ali's impl of Bernardin's algm) also handles the univariate case, and seems to be fast enough (or will be once a proper GCD is available).
Closing.
#2 Updated by Anna Maria Bigatti over 10 years ago
- Target version set to CoCoALib-0.99531