Recovering planted solutions to Random CSPs
Statement
Is there any planted random CSP for which there is an algorithm that finds a solution in time that is closer to the planted solution (as measured in expected Hamming distance) by at least for a constant than the solution returned by Belief Propagation?
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.