NP-hardness of bit allocation in multiuser multicarrier communications

In this paper, we consider the problem of optimal bit allocation for a multiuser multicarrier communications. Some of the existing papers comment, without a proof, on the intractability of the problem and provide algorithms resulting in suboptimal bit allocation to reduce the computation complexity. A formal proof for classifying this problem as being NP-hard is presented in this article.