Kahn–Kalai conjecture on DNF approximation of low-influence biased Boolean functions
Statement
Let be a monotone Boolean function with expectation , and let denote its total influence. A DNF of width is a union of sub-cubes of co-dimension at most . Kahn–Kalai's conjecture. For any , there exists such that, whenever
can be -approximated by a DNF of width at most . This conjecture concerns the structure of biased Boolean functions whose influence is within a constant factor of the minimum possible; the paper presents it as an open problem, while the stated approximation theorem is the target assertion.
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.