On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).

From MaRDI portal
Publication:1978699

DOI10.1016/S0304-3975(99)00182-6zbMath1058.94027OpenAlexW2091423939WikidataQ62472235 ScholiaQ62472235MaRDI QIDQ1978699

D. Pochuev, René Peralta, Joan. Boyar

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00182-6



Related Items



Cites Work