On the Complexity of Minimizing Quasicyclic Boolean Functions

DOI10.1134/S1990478918030043zbMath1413.94078OpenAlexW2888258102MaRDI QIDQ4558299

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)

Related Items (1)

On the Minimization of Boolean Functions for Additive Complexity Measures

Cites Work

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

This page was built for publication: On the Complexity of Minimizing Quasicyclic Boolean Functions