Recently I studied a MIT open course.
In lecture2, it is stated that Rectangle Packing is NP-hard.
I can understand this because the problem can be reduced to 3-partition problem
But I don't know why it's an open problem whether it's in NP.
In lecture2 it is stated that:
it is complicated to encode rotations efficiently.
My question: How to understand the last sentence?