On the complexity of minimizing quasicyclic Boolean functions

DOI10.1134/S1990478918030043zbMATH Open1413.94078OpenAlexW2888258102MaRDI QIDQ4558299FDOQ4558299

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

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

zbMATH Keywords

complexitydominationextentindependent family of setsminimization of Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• On algorithm complexity
• Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
• Maximal length of circuit in a unitary \(n\)-dimensional cube
• Title not available (Why is that?)
• On complexity measures of complexes of faces in the unit cube
• Title not available (Why is that?)
• Proof of covering minimality by generalizing the notion of independence
• Algorithms using first-order neighborhoods for minimization of Boolean functions

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)