Is there an algorithm for any given Boolean formula can return the most simplified form of the formula?

159 Views Asked by At

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?

1

There are 1 best solutions below

0
On

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