Given the $n\times m$ rectangle, I want to compute the minimum number of integersided squares needed to tile it (possibly of different sizes). Is there an efficient way to calculate this?
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
