On minimal complexes of faces in the unit cube
zbMATH Open1324.52010MaRDI QIDQ5263776FDOQ5263776
Authors: I. P. Chukhrov 
Publication date: 17 July 2015
Full work available at URL: http://mathnet.ru/eng/da692
Recommendations
- On complexity measures of complexes of faces in the unit cube
- On the relation between the irredundant and minimal complexes of faces in the unit cube.
- On irredundant 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
faceintervalBoolean functionminimal coveringcomplexity measurecomplex of faces in \(n\)-dimensional unit cubenumber of minimal complexes of faces
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Boolean functions (06E30)
Cited In (10)
- Minimal complexes of faces of a random Boolean function.
- On kernel and shortest complexes of faces in the unit cube
- The number of faces in a minimal foam
- On the relation between the irredundant and minimal complexes of faces in the unit cube.
- On the complexity of representing sets of vertices in the \(N\)-cube
- On a minimization problem for a set of Boolean functions
- On irredundant complexes of faces in the unit cube
- Geometry of translations on a Boolean cube
- On complexity measures of complexes of faces in the unit cube
- On the minimization of Boolean functions for additive complexity measures
This page was built for publication: On minimal 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 Q5263776)
