OP-00548 Open Polynomial-time detection below the planted-clique square-root threshold ST · AIM Open Applied Problems · computational lower bounds · planted cliques · random graphs