Statistical Complexity of Algorithms for Boolean Function Minimization

DOI10.1145/321281.321287zbMath0139.32604OpenAlexW2071554325MaRDI QIDQ5514816

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

Related Items (3)

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

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