lcai@ai.toronto.edu (Cai Leizhen) (11/18/89)
I would like to know the complexity of the following problem. Given a M*N rectangle, find the minimum number of squares required to exactly cover the rectangle. Note: No restrcition on sizes of squares. You can cover it use M*N squares, for example. Any comments will be appreciated. I guess it may be studied already, but I could not find any references. Leizhen Cai Dept. of Computer Science Univ. of Toronto lcai@csri.utoronto.ca