My question concerns the NP-hardness of the following discrete optimization problem:

Given a matrix $A \in \{ \pm 1 \}^{m\times n}$,

$$\begin{array}{ll} \underset{x \in \{ \pm 1 \}^m ,\, y \in \{ \pm 1 \}^n}{\text{maximize}} & x^T A \, y\end{array}$$

Is this problem known to be NP-hard?

  • $\begingroup$ If $A$ can also have zero entries, then it is NP-hard. I doubt this is really necessary, but I don't have an immediate argument for this. $\endgroup$
    – J.G
    Jun 23 at 19:24

NP-hardness is proved by Roth and Viswanathan in the paper On the hardness of decoding the gale-berlekamp code


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.