A set of p-valued logic gates (primitives) is called universal if an arbitrary p-valued logic function can be realized by a logic circuit built up from a finite number of gates belonging to this set. In the paper, we consider the problem of determining the number of universal single-element sets of ternary reversible logic gates with two inputs and two outputs. We have established that over 97%...

Most logic synthesis algorithms work on graph representations of functions with nodes associated arbitrary expressions or simple and iteratively optimize such graphs. While recent multilevel efforts focused primarily graphs 2-input as AND OR gates, the recently proposed paradigm Majority-Inverter Graphs (MIGs) instead uses 3-input Majority gate node function. As this technique proved to be a su...