Sympathy-MV: Fast exact minimization of fixed polarity multi-valued linear expressions

In this paper a polynomial time algorithm for the minimization of fixed polarity multi-valued linear expressions (FPMVLs) for totally symmetric functions based on an extension of binary moment diagrams (BMDs) is presented. A generalization to partially symmetric functions is investigated.