I have to write an algorithm in C++ to determine the (i)reductibility of a polynomial of degree "n"
Berlekamp algorithm is preferred.
The Attempt at a Solution
I have Googled for almost an hour now and didn't find anything helpful.
I could use (in order):
- A specific example on how Berlekamp fatorization works.