Computes the minimal disjuntive normal form for a given truth table.

1 | ```
minDNF(mat)
``` |

`mat` |
a matrix containing only 0's and 1's. Each column of |

An object of class `minDNF`

containing a vector comprising a minimized set of prime implicants. If more than
one solution exist, then a list is returned containing all solutions.

Holger Schwender, holger.schwender@udo.edu

Schwender, H. (2007). Minimization of Boolean Expressions Using Matrix Algebra. Technical Report, SFB 475, Department of Statistics, TU Dortmund University.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.