On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
From MaRDI portal
Publication:5375393
DOI10.1109/12.73590zbMath1395.68144OpenAlexW2108016168MaRDI QIDQ5375393
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.73590
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Chain reduction for binary and zero-suppressed decision diagrams ⋮ On the weightwise nonlinearity of weightwise perfectly balanced functions ⋮ DQBDD: an efficient BDD-based DQBF solver
This page was built for publication: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication