Comment by evenhash
2 months ago
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.
2 months ago
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.
No comments yet
Contribute on Hacker News ↗