I need to write a program that minimizes a boolean function. Selecting one of the most efficient algorithms, I selected 3 among them: Quine McCluskey, using Gray codes, as well as the Espresso heuristic algorithm.
A question about using minimization in practice to select an algorithm - how many input variables do Boolean functions usually use?
