Decompositions of positive self-dual Boolean functions

DOI10.1016/0012-365X(94)00053-LzbMath0839.94016OpenAlexW2082478577MaRDI QIDQ1893164

Jan C. Bioch, Toshihide Ibaraki

Publication date: 24 June 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00053-l

zbMATH Keywords

algorithmdecompositionhypergraphsmonotone Boolean functionsself-dual functionscoteriesself-dual Boolean function

Mathematics Subject Classification ID

Related Items (9)

Decomposability of partially defined Boolean functions ⋮ A stronger LP bound for formula size lower bounds via clique constraints ⋮ From logical gates synthesis to chromatic bicritical clutters ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ Counting and enumerating aggregate classifiers ⋮ Invariant continuous aggregation functions ⋮ Special issue: Boolean functions and related problems ⋮ Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dualization of regular Boolean functions
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• On generating all maximal independent sets
• Complexity of identification and dualization of positive Boolean functions
• How to assign votes in a distributed system
• On the monomiality of groups whose third derived group is trivial.
• Time, clocks, and the ordering of events in a distributed system
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

This page was built for publication: Decompositions of positive self-dual Boolean functions