Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Shechter, Yarin"'
Detecting if a graph contains a $k$-Clique is one of the most fundamental problems in computer science. The asymptotically fastest algorithm runs in time $O(n^{\omega k/3})$, where $\omega$ is the exponent of Boolean matrix multiplication. To date, t
Externí odkaz:
http://arxiv.org/abs/2401.13502
