# Is there a known relationship between Kolmogorov Complexity of a binary string and the logic optimization of the corresponding Boolean function?

I haven't thought about how to go about proving it or finding a counterexample (I probably don't have the right background), but it seems intuitive to me that, given some representation of a Boolean function, say sum of products, the minimal SOP expression is somehow related to the Kolmogorov Complexity of the binary string representation. I've done some searching but can't find anything. If you don't know of a relationship but know of related references, please share.