Slug #952
GCD very slow
Status:
Closed
Priority:
Normal
Assignee:
Category:
Improving
Target version:
Description
While testing IsSqFree
I observed that CoCoALib is very slow at computing gcd(f,f')
where f = (x^2+1)*(x^27-x)
in ZZ/(3)[x]
.
Make it faster!
Related issues
History
#1 Updated by John Abbott over 7 years ago
- Related to Feature #127: Convert DUPFF code to C++ added
#2 Updated by John Abbott over 7 years ago
- Related to Feature #951: New function: IsSqFree added
#3 Updated by John Abbott over 7 years ago
- Related to Slug #480: gcd too slow for large degree univariate poly added
#4 Updated by John Abbott over 7 years ago
- Related to Feature #257: Transcribe C4 code for GCD in QQ[x] added
#5 Updated by John Abbott over 7 years ago
- Related to Slug #129: Better GCD added
#6 Updated by John Abbott over 4 years ago
- Status changed from New to Closed
- Assignee set to John Abbott
- Target version changed from CoCoALib-1.0 to CoCoALib-0.99650 November 2019
- % Done changed from 0 to 100
- Estimated time set to 0.33 h
It is no longer very slow; no sure how fast it is (seems to be instant).
Closing.