Computer algorithms, Quantum computers, Decomposition (Mathematics)
This presentation discusses an approach to decomposition of multivalued functions and relations into networks of two-input gates implementing multi-valued MIN and MAX operations. The algorithm exploits both the incompleteness of the initial specification and the flexibilities generated in the process of decomposition. Experimental results over a set of multi-valued benchmarks show that this approach outperforms other approaches in the quality of final results and CPU time.
Mishchenko, Alan, Bernd Steinbach, and Marek Perkowski. "Bi-decomposition of multi-valued relations." International Workshop on Logic and Synthesis. 2001.