ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be drawn from the (m,n,1/2)(m,n,1/2)-Bernoulli ensemble, where CC is a universal constant and n≥Cmlog⁡mn\geq C m\log m. Computational hardness conjecture. With high probability, no efficient algorithm finds a solution of constant discrepancy for AA.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 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.