rings

rings copied to clipboard

This can considerably speed up arithmetic in Z/p[x] for p > 2^64 and GF[x] (used quite often)

PoslavskySV

ZippelGCD rarely fails on some dense input.

1

Test case: ```java @Test public void testSmallDomain6() throws Exception { IntegersZp64 ring = Rings.Zp64(3); MultivariatePolynomialZp64 a = MultivariatePolynomialZp64.parse("1 + a + 5*b + 7*c + d + 11*e + 13*f...

PoslavskySV

LinZip makes too many loop cycles (system is `UnderDetermied`) with Vandermonde powers (`(evaluationPoint) ^ (iTry)`). The answer will not be even obtained if `NUMBER_OF_UNDER_DETERMINED_RETRIES` is too small (each evaluation `(evaluationPoint)...

PoslavskySV

It may be faster than Algorithm 15.17 in _[J von zur Gathen, J Gerhard]_

PoslavskySV