ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The Fooling-Set-Submatrix problem takes integers n,mn,m and an m×mm\times m 0/10/1-matrix AA as input, and asks whether AA contains a fooling-set submatrix of size nn. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.