Multiplicative complexity of some Boolean functions

From MaRDI portal

Publication:314127

Jump to:navigation, search

DOI10.1515/DMA-2015-0010zbMath1347.94084OpenAlexW2321643073MaRDI QIDQ314127

Svetlana N. Selezneva

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2015-0010

zbMATH Keywords

complexity upper bound circuit Boolean function multiplicative (conjunctive) complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Multiplicative complexity of some Boolean functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:314127&oldid=12192585"