ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p-\texttt{NPP} and u-\texttt{NPP} denote the planted and unplanted random number partitioning problems, respectively. For a fixed c>1c>1, consider distinguishing these two models in the regime described by the hypothesis-testing problem.

Polynomial-time indistinguishability conjecture. Fix any c>1c>1. There exists no polynomial-time algorithm that distinguishes the p-\texttt{NPP} from the u-\texttt{NPP} with probability greater than 12\frac12.

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 2−cn2^{-cn} 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 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.