NP-completeness threshold conjecture for dense partial Latin-square completion
Statement
Let , and consider the decision problem of completing an arbitrary -dense partial Latin square, where an partial Latin square is -dense if each symbol, row, and column contains at most nonblank cells. NP-completeness threshold conjecture. For every , this completion problem is NP-complete; conversely, for every , it is in P. The paper proves NP-completeness for every and presents the conjecture as the corresponding sharp complexity threshold, but does not resolve the range between and .
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.