logic - Modifying Quine-McCluskey Algorithm for Different Cost Function -

logic - Modifying Quine-McCluskey Algorithm for Different Cost Function -

the standard cost function quine-mccluskey seems involve minimizing number of , gates. purposes, need minimize number of literals instead of number of , gates (for example, take ab+cd on abcde since has 4 literals instead of 5, though has 1 more , gate). can give me pointers on how different cost function alter algorithm?

algorithm logic computer-science cad computer-science-theory