Polynomial-time indistinguishability conjecture for planted and unplanted number partitioning
Statement
Let p-\texttt{NPP} and u-\texttt{NPP} denote the planted and unplanted random number partitioning problems, respectively. For a fixed , consider distinguishing these two models in the regime described by the hypothesis-testing problem.
Polynomial-time indistinguishability conjecture. Fix any . There exists no polynomial-time algorithm that distinguishes the p-\texttt{NPP} from the u-\texttt{NPP} with probability greater than .
This conjecture concerns the computational tractability of hypothesis testing between the planted and unplanted models. The source motivates it by noting statistical distinguishability when values below occur, while leaving efficient distinguishing open.
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.