On complexity measures of complexes of faces in the unit cube

DOI10.1134/S1990478914010025MaRDI QIDQ5264720zbMATH OpenOpenAlexFDO

Authors I. P. Chukhrov

Publication date 27 July 2015

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

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

zbMATH Keywords

faceBoolean functioncomplexity measureminimal complex of facescomplex of faces in the unit cube

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• On minimal complexes of faces in the unit cube
• On the relation between the irredundant and minimal complexes of faces in the unit cube.
• Minimal complexes of faces of a random Boolean function.
• On kernel and shortest complexes of faces in the unit cube
• On irredundant complexes of faces in the unit cube

Cited in

(11)

• Minimal complexes of faces of a random Boolean function.
• On kernel and shortest complexes of faces in the unit cube
• On the relation between the irredundant and minimal complexes of faces in the unit cube.
• On the complexity of minimizing quasicyclic Boolean functions
• On the complexity of representing sets of vertices in the \(N\)-cube
• Hausdorff metric on faces of the n-cube
• On minimal complexes of faces in the unit cube
• On a minimization problem for a set of Boolean functions
• On irredundant complexes of faces in the unit cube
• Proof of covering minimality by generalizing the notion of independence
• On the minimization of Boolean functions for additive complexity measures

This page was built for publication: On complexity measures of complexes of faces in the unit cube

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