Statistical Complexity of Algorithms for Boolean Function Minimization

DOI10.1145/321281.321287MaRDI QIDQ5514816zbMATH OpenOpenAlexFDO

Authors F. Mileto, Gianfranco R. Putzolu

Publication date 1965

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321281.321287

zbMATH Keywords

numerical analysis

Cited in

(3)

• Algebraic nonlinearity and its applications to cryptography
• Boolean function minimization in the class of disjunctive normal forms
• Nombre moyen de majorants d'une fonction Booléenne incomplète. Remarques concernant le nombre moyen de monômes premiers

This page was built for publication: Statistical Complexity of Algorithms for Boolean Function Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514816)