On the Minimization of Boolean Functions for Additive Complexity Measures

DOI10.1134/S1990478919030049zbMath1438.90238OpenAlexW2970207108WikidataQ127280028 ScholiaQ127280028MaRDI QIDQ4973262

I. P. Chukhrov

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919030049

zbMATH Keywords

Boolean functionface complexcomplexity measureface of a Boolean cubeminimal face complex

Mathematics Subject Classification ID

Boolean programming (90C09) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• On a minimization problem for a set of Boolean functions
• On the Complexity of Minimizing Quasicyclic Boolean Functions
• The shortest disjunctive normal form of a random Boolean function
• On complexity measures of complexes of faces in the unit cube

This page was built for publication: On the Minimization of Boolean Functions for Additive Complexity Measures