Feature #47
Feature #39: Squarefree factorization
Feature #43: Squarefree factorization - for polynomials
Squarefree factorization - multivariate polynomials
100%
Description
A bit tricker than univariate. Seems to need content-free factorization.
Subtasks
Related issues
History
#1 Updated by John Abbott over 10 years ago
- Status changed from New to In Progress
- Assignee set to John Abbott
JAA is translating Alessio D'Ali's impl (in CoCoA5) into C++.
Most of the translation is complete, but it does not yet compile (even less pass the tests).
#2 Updated by John Abbott over 10 years ago
Translation of d'Ali's impl is now complete.
Code has been checked in; incl doc and tests.
Some minor points remain outstanding (regarding execution speed and/or working in unusual rings); I've decided to ignore them for the time being.
Here are some "unusual" rings we should eventually handle:QQ[x][y,z]
QQ(x)[y,z]
-- this should already work (if GCD works)ZZ/(p)[x][y,z]
FrF(ZZ/(p)[x])[y,z]
-- this already works, I believe
#3 Updated by Anna Maria Bigatti over 10 years ago
- Target version set to CoCoALib-0.99532
#4 Updated by John Abbott about 10 years ago
- Status changed from In Progress to Closed
For many practical purposes this issue is complete.
True completion now depends on #515, so I shall close this, and add a new issue (to complete sqfr once 515 has been done).