I’m working on a Karatsuba algorithm for polynomial multiplication, and I was wondering if it’s possible to transform the standard Karatsuba algorithm into a dynamic programming approach (either bottom-up or top-down). If it’s possible, how would it look?
Tried it myself but i couldnt find a solution
New contributor
Sydney is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.