On a minimization problem for a set of Boolean functions

DOI10.1134/S1990478915030059zbMath1349.90631OpenAlexW2207050677MaRDI QIDQ3186833

I. P. Chukhrov

Publication date: 12 August 2016

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

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

zbMATH Keywords

faceunit cubeBoolean functionadditive complexity measurecomplex of facesminimal complex of facesshortest complex of faces

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Boolean programming (90C09) Boolean functions (06E30) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Proof of covering minimality by generalizing the notion of independence ⋮ On the Minimization of Boolean Functions for Additive Complexity Measures

Cites Work

• On complexity measures of complexes of faces in the unit cube
• Discrete optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a minimization problem for a set of Boolean functions