1 problem

Let $\gamma>0$ be a positive real number. In the word RAM model with word size $O(\log n)$ bits, consider algorithms deciding whether a graph with $m$ edges contains a triangle. Tr…