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]
@inproceedings{CarpovAS17-0,
title = {A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits},
author = {Sergiu Carpov and Pascal Aubry and Renaud Sirdey},
year = {2017},
doi = {10.1007/978-3-319-78825-8_23},
url = {https://doi.org/10.1007/978-3-319-78825-8_23},
researchr = {https://researchr.org/publication/CarpovAS17-0},
cites = {0},
citedby = {0},
pages = {275-286},
booktitle = {Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
editor = {Ljiljana Brankovic and Joe Ryan 0001 and William F. Smyth},
volume = {10765},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-78825-8},
}