10 Lectures and 42 Open Problems — The planted clique problem
Statement
Is there a polynomial time algorithm that is able to find the largest clique of (with high probability) for ? For example, for ? Is there a polynomial time algorithm that is able to distinguish, with high probability, from a draw of for ? For example, for ? Is there a quasi-linear time algorithm able to find the largest clique of (with high probability) for , for some ? (This question was posed here )
Record
- Source
- 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.