The existence of ρ > 1 for which polynomial time algorithms can find cliques of size ρ log n is a longstanding open problem. In the classical planted clique ...
確定! 回上一頁