On the Complexity of K-Dimensional-Matching