Compact Representations of Matroids Using Binary Decision Diagrams and Zero-Suppressed Binary Decision Diagrams

This paper initiates the study of binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) as relatively compact data structures for representing matroids in a computer. The focus is on analyzing the sizes of BDDs and ZDDs for representing matroids.