Given the $n\times m$ rectangle, I want to compute the minimum number of integer-sided squares needed to tile it (possibly of different sizes).
Is there an efficient way to calculate this?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
4 years ago