Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

ZippelGCD rarely fails on some dense input. #20

Open
PoslavskySV opened this issue Dec 2, 2017 · 1 comment
Open

ZippelGCD rarely fails on some dense input. #20

PoslavskySV opened this issue Dec 2, 2017 · 1 comment

Comments

@PoslavskySV
Copy link
Owner

Test case:

@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 + g", ring),
            b = MultivariatePolynomialZp64.parse("1 - a + 5*b - 7*c + d - 11*e + 13*f - g", ring),
            g = MultivariatePolynomialZp64.parse("1 + a - 5*b + 7*c - d + 11*e - 13*f + g", ring);

    int exp = 7;
    a = PolynomialMethods.polyPow(a, exp);
    b = PolynomialMethods.polyPow(b, exp);
    g = PolynomialMethods.polyPow(g, exp);

    MultivariatePolynomialZp64 ag = a.clone().multiply(g);
    MultivariatePolynomialZp64 bg = b.clone().multiply(g);

    System.out.println(PolynomialGCD(ag, bg));
}
@PoslavskySV PoslavskySV added this to the 2.2 milestone Dec 2, 2017
PoslavskySV added a commit that referenced this issue Dec 2, 2017
@PoslavskySV
Copy link
Owner Author

EEZ-GCD works fine on this input.

@PoslavskySV PoslavskySV modified the milestones: 2.2, 2.3 Dec 6, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant