A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits
In this work we propose a multi-start heuristic which aims at minimizing the multiplicative depth of boolean circuits. The multiplicative depth objective is encountered in the field of homomorphic encryption where ciphertext size depends on the number of consecutive multiplications. The heuristic is based on rewrite operators for multiplicative depth-2 paths. Even if the proposed rewrite operators are simple and easy to understand the experimental results show that they are rather powerful. The multiplicative depth of the benchmarked circuits was hugely improved. In average the obtained multiplicative depths were lower by more than 3 times than the initial ones. The proposed rewrite operators are not limited to boolean circuits and can also be used for arithmetic circuits.
S. Carpov, P. Aubry, R. Sirdey (2018) A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. In: Brankovic L., Ryan J., Smyth W. (eds) Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science, Vol. 10765, Springer, Cham. https://doi.org/10.1007/978-3-319-78825-8_23