The search space for a naive brute force of three polynomials of degree <= 7 with integer coefficients <= 12 is roughly 10^500. I think it would take a little l

The search space for a naive brute force of three polynomials of degree <= 7 with integer coefficients <= 12 is roughly 10^500. I think it would take a little longer than that.