ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϵ>0\epsilon>0, and consider the decision problem of completing an arbitrary ϵ\epsilon-dense partial Latin square, where an n×nn\times n partial Latin square is ϵ\epsilon-dense if each symbol, row, and column contains at most ϵn\epsilon n nonblank cells. NP-completeness threshold conjecture. For every ϵ>14\epsilon>\frac{1}{4}, this completion problem is NP-complete; conversely, for every ϵ≤14\epsilon\leq\frac{1}{4}, it is in P. The paper proves NP-completeness for every ϵ>12\epsilon>\frac{1}{2} and presents the conjecture as the corresponding sharp complexity threshold, but does not resolve the range between 14\frac{1}{4} and 12\frac{1}{2}.

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.