The complexity of AND-decomposition of Boolean functions

From MaRDI portal
Publication:2181249

DOI10.1016/j.dam.2019.07.005zbMath1481.94166OpenAlexW2963804349MaRDI QIDQ2181249

P. G. Emelyanov, Denis K. Ponomaryov

Publication date: 18 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.07.005




Related Items (1)


Uses Software


Cites Work


This page was built for publication: The complexity of AND-decomposition of Boolean functions