We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I did the first test case correctly, but I timed out on all the other cases. I am using modular Gaussian elimination to find the optimum polynomials. Is there a recurrence realtionship that I should be using instead of the costly O(n^3) operation.
Project Euler #101: Optimum polynomial
You are viewing a single comment's thread. Return to all comments →
I did the first test case correctly, but I timed out on all the other cases. I am using modular Gaussian elimination to find the optimum polynomials. Is there a recurrence realtionship that I should be using instead of the costly O(n^3) operation.