Soeken, MHaaswijk, WTesta, EMishchenko, AAmaru, LGBrayton, RKDe Micheli, G2018-11-082018-11-082018-11-08201810.23919/DATE.2018.8342027https://infoscience.epfl.ch/handle/20.500.14299/150796In this paper, we discuss recent advances in exact synthesis, considering both their efficient implementation and various applications in which they can he employed. We emphasize on solving exact synthesis through Boolean satisfiability (SAT) encodings. Different SAT encodings for exact synthesis are compared, and examined the applications to multi-level logic synthesis, in both area and depth optimization. Another application of SAT based exact synthesis is optimization under many constraints. These constraints can, e.g., be a fixed fanout or delay constraints. Finally, we end our discussion by proposing directions for future research in exact synthesis.optimal networksminimizationcircuitsgraphsgatessatnortext::conference output::conference proceedings::conference paper