The computational hardness conjecture for constant discrepancy
Statement
Let be drawn from the -Bernoulli ensemble, where is a universal constant and . Computational hardness conjecture. With high probability, no efficient algorithm finds a solution of constant discrepancy for .The conjecture is motivated by the planted model, where clusters of low-discrepancy solutions are isolated from one another. It asserts an algorithmic barrier for finding constant-discrepancy solutions in the stated random regime.
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.