Vertex Cover of size at most $\log n$

Question

Consider the following language: $$ L = \{ G | G \text{ has a VC of size at most } \log n \} $$

Does $L\in P$ or $L\in NPC$?