On the Multiplicative Complexity of Boolean Functions

From MaRDI portal

Publication:4976406

Jump to:navigation, search

DOI10.3233/FI-2016-1368zbMath1395.94405OpenAlexW2517433696MaRDI QIDQ4976406

Svetlana N. Selezneva

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1368

zbMATH Keywords

complexity upper bound circuit Boolean function multiplicative complexity

Mathematics Subject Classification ID

This page was built for publication: On the Multiplicative Complexity of Boolean Functions

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