On the complexity of minimizing quasicyclic Boolean functions

DOI10.1134/S1990478918030043MaRDI QIDQ4558299zbMATH OpenOpenAlexFDO

Authors I. P. Chukhrov

Publication date 21 November 2018

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

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

zbMATH Keywords

complexitydominationextentindependent family of setsminimization of Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On a minimization problem for a set of Boolean functions
• On the multiplicative complexity of quasi-quadratic Boolean functions
• Minimal complexes of faces of a random Boolean function.
• On the minimization of Boolean functions for additive complexity measures
• The conjunctive complexity of quadratic Boolean functions

Cites work

• scientific article; zbMATH DE number 4089620 (Why is no real title available?)
• scientific article; zbMATH DE number 3760092 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithms using first-order neighborhoods for minimization of Boolean functions
• Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
• Maximal length of circuit in a unitary \(n\)-dimensional cube
• On algorithm complexity
• On complexity measures of complexes of faces in the unit cube
• Proof of covering minimality by generalizing the notion of independence

Cited in

(2)

• On a minimization problem for a set of Boolean functions
• On the minimization of Boolean functions for additive complexity measures

This page was built for publication: On the complexity of minimizing quasicyclic Boolean functions

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