0
$\begingroup$

Is there an algorithm for any given Boolean formula can return the most simplified form, that is to say, the shortest form with respect to the number of symbols (regarding $\{\lnot, \lor\}$, or $\{\lnot, \lor, \land\}$, for example) of the formula? Or if not,is there any relevant work?

$\endgroup$
1

1 Answer 1

1
$\begingroup$

This work on minimizing boolean functions might be what you're looking for. It is quite extensive.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .