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?