Do exponential functions grow faster than logarithmic?
I think you may be confused about the definition of Big O - graphing f(n) and g(n) shows f(n) surpassing g(n) at nearly every scale.

O(f(n)) &gt; O(g(n) because g(n) is a fractional power polynomial, which is by definition sublinear (if you linearly plug numbers into a square root, cube root, etc., the rate at which the output increases decreases with each successive computation). g(n) is a "n log star n" polynomial meaning it follows the form of a log to a power multiplied by n. The rate of growth of these types of functions far exceeds fractional polynomials and its not hard to see why - n is a term of the function, so we know its at least linear.

Here's a helpful resource: https://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities