On the minimization of Boolean functions for additive complexity measures
DOI10.1134/S1990478919030049zbMATH Open1438.90238OpenAlexW2970207108WikidataQ127280028 ScholiaQ127280028MaRDI QIDQ4973262FDOQ4973262
Authors: 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
Recommendations
- On minimal complexes of faces in the unit cube
- On a minimization problem for a set of Boolean functions
- 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.
- Minimal complexes of faces of a random Boolean function.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean programming (90C09) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- On a minimization problem for a set of Boolean functions
- On complexity measures of complexes of faces in the unit cube
- The shortest disjunctive normal form of a random Boolean function
- Title not available (Why is that?)
- On the complexity of minimizing quasicyclic Boolean functions
Cited In (5)
- Primitivity, uniform minimality, and state complexity of Boolean operations
- On the complexity of minimizing quasicyclic Boolean functions
- On a minimization problem for a set of Boolean functions
- Geometry of translations on a Boolean cube
- Proof of covering minimality by generalizing the notion of independence
This page was built for publication: On the minimization of Boolean functions for additive complexity measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973262)
