NP-hardness of the Fooling-Set-Submatrix problem
Statement
The Fooling-Set-Submatrix problem takes integers and an -matrix as input, and asks whether contains a fooling-set submatrix of size . NP-hardness conjecture. The Fooling-Set-Submatrix problem is NP-hard. The computational complexity of this problem is stated to remain open in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.