The complexity of modular decomposition of Boolean functions

DOI10.1016/j.dam.2003.12.010zbMath1077.06013OpenAlexW2135652786MaRDI QIDQ2387426

Jan C. Bioch

Publication date: 2 September 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.12.010

zbMATH Keywords

computational complexityBoolean functionmodular setmodular closuregeneralized Shannon decomposition

Mathematics Subject Classification ID

Related Items (4)

Algorithmic issues of AND-decomposition of Boolean formulas ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables ⋮ Algorithmic aspects of a general modular decomposition theory

Uses Software

• HINT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to find the smallest committee containing a given set
• Learning by discovering concept hierarchies
• Decomposability of partially defined Boolean functions
• Minimum self-dual decompositions of positive dual-minor Boolean functions
• Complexity of identification and dualization of positive Boolean functions
• On the composition and decomposition of clutters
• Graph Classes: A Survey
• An Algorithm for the Modular Decomposition of Hypergraphs
• Bimatroidal independence systems
• Modules of Coherent Binary Systems

This page was built for publication: The complexity of modular decomposition of Boolean functions