A multi-start heuristic for multiplicative depth minimization of Boolean circuits
From MaRDI portal
Publication:1642709
DOI10.1007/978-3-319-78825-8_23zbMath1504.68063OpenAlexW2798283472MaRDI QIDQ1642709
Renaud Sirdey, Pascal Aubry, Sergiu Carpov
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_23
Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
This page was built for publication: A multi-start heuristic for multiplicative depth minimization of Boolean circuits
