# Does finding a cycle with $\log n$ length in $\text{P}$?

Let $$G$$ be an arbitrary graph with $$n$$ vertices and we want to find a simple cycle with $$\log n$$ length. Is there exists a known polynomial algorithm for this problem?