-
Are multivariate polynomials planned to be supported, or does this package focuses specifically on univariate polynomials?
For example, I would be interested in performing the following factorizati…
-
When I implemented polynomial factoring in 2016, the following were the times:
Poly | NTL | Magma | Flint-1.6 | New
-------|------------|-----------------|--…
-
OM Tree construction and a native sage implementation of padic polynomial factoring using it. This factorization works for polynomials over Zp as well as over unramified and totally ramified extens…
-
First of all: I am a very grateful user of this great library. Thank you for creating it!
I encountered a problem:
Factoring the polynomial x^70+1 is extremely slow (25 seconds on my computer)
…
-
Consider f in R = QQ(x)[y], then
- factor(f) does not work
- quo(R, f) does not work, ResidueRing does
- for elems in the quotient, charpoly, minpoly does not work (via rep-mat?)
Just to note…
-
Currently we have a lot of isolated profiling and example programs, but no automatic way to aggregate performance benchmarks. A unified benchmark suite would be useful to catch performance regressions…
-
Add various methods to polynomial_padic.py for invariant computations and Monge reduction and update factor() to use OMTree from #12561 for factoring polynomials over p-adic extensions.
In all, thi…
-
The goal of this patch is to speed-up NTL's factoring algorithm for polynomials in Z[X]. The speed-up comes from using fpLLL rather than NTL's native LLL algorithm. We do this by converting a ZZ_m…
-
When factoring certain polynomials with `factor_list` while using an algebraic extension, specifically those of the form `(_+_*extension)*polynomial`, sympy will raise a `PolificationFailed: can't con…
-
Added specialized code for factoring quadratic polynomials over GF(2^m).
Component: **algebra**
Keywords: **quadratics, characteristic 2**
Work Issues: **rebase**
Author: **Preston Wake, Wouter …