Binary decision diagrams for Boolean polynomial rings
by Ioana Tamas for lmonade: scientific software distribution
Zero-suppressed binary decision diagrams are used by Polybori for efficiently representing Boolean polynomials. At the moment, they are manipulated via CUDD, which is not specialized on this type of diagrams and only uses C in the implementation. The goal of the project is implementing an independent library in C++, that is specialized on zero-suppressed binary decision diagrams.