Answers are grounded in this paper and cite their sources.
By quite elementary means, one can find “large” examples difficult, if not (for practical purposes) impossible, to be managed by that host of methods, after Quine, for minimizing expressions in alternational normal form. Because the workability rather than existence of an algorithm for minimizing logical formulae is generally critical, it may be pertinent to outline briefly the derivation of these “large” examples. Some more general insight may also be gained about simplification techniques.
No takes yet. Share an insight, caveat, or question.
Dunham et al. (1959) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: