Minimal complexes of faces of a random Boolean function.

zbMATH Open1324.06017MaRDI QIDQ5264763FDOQ5264763

Authors: I. P. Chukhrov 

Publication date: 27 July 2015

Full work available at URL: http://mathnet.ru/eng/da795

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.
• On irredundant complexes of faces in the unit cube
• scientific article; zbMATH DE number 3916176
• On complexity measures of complexes of faces in the unit cube

zbMATH Keywords

complexity measuresrandom Boolean functionscomplexes of faces

Mathematics Subject Classification ID

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

Cited In (11)

• 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
• Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes
• On minimal complexes of faces in the unit cube
• Minimizability of random Boolean functions
• On a minimization problem for a set of Boolean functions
• On irredundant complexes of faces in the unit cube
• On complexity measures of complexes of faces in the unit cube
• On the minimization of Boolean functions for additive complexity measures
• Title not available (Why is that?)

This page was built for publication: Minimal complexes of faces of a random Boolean function.

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