A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits

Sergiu Carpov, Pascal Aubry, Renaud Sirdey. A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. In Ljiljana Brankovic, Joe Ryan 0001, William F. Smyth, editors, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. Volume 10765 of Lecture Notes in Computer Science, pages 275-286, Springer, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.