Basically, yes. Not just to V4, but to programming generally. IIRC, the Quine-McCluskey algorithm tends to be used for reducing boolean expressions—but it’s also the case that people seldom write expressions which require reducing or even have enough terms to be reduced. Conditions with even four terms are fairly unusual in application programming, and evaluation of boolean expressions is practically never a bottleneck.
I’d like to see an example of where you think it would be useful.