Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
我正在研究 Clique 问题和算法。然后我看到了。正如本文所说，我们可以在 O(n^2) 时间复杂度中找到最大团。我是不是误会了什么，或者这是 P=NP 的证明？