Online discrepancy conjecture
Statement
Determine whether there exist universal constants and a polynomial-time online signing algorithm such that, for every dimension and every finite horizon , when are independent samples from , the algorithm chooses each upon seeing and satisfies . The algorithm should operate online and its guarantee should be independent of .
Record
- Added
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.