Boolean minors

DOI10.1016/0012-365X(93)E0191-6zbMath0837.68081OpenAlexW2912948490MaRDI QIDQ1894774

Chi Wang

Publication date: 16 April 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0191-6

zbMATH Keywords

monotonic Boolean functionsthreshold Boolean functionsBoolean minors

Mathematics Subject Classification ID

Related Items (16)

Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) ⋮ Parametrized arity gap ⋮ Descending chains and antichains of the unary, linear, and monotone subfunction relations ⋮ Reconstructing permutations from identification minors ⋮ The arity gap of order-preserving functions and extensions of pseudo-Boolean functions ⋮ On a quasi-ordering on Boolean functions ⋮ Decompositions of functions based on arity gap ⋮ RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS ⋮ Clones with finitely many relative \({\mathcal R}\)-classes ⋮ Algebraic and topological closure conditions for classes of pseudo-Boolean functions ⋮ ADDITIVE DECOMPOSABILITY OF FUNCTIONS OVER ABELIAN GROUPS ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ ON THE EFFECT OF VARIABLE IDENTIFICATION ON THE ESSENTIAL ARITY OF FUNCTIONS ON FINITE SETS ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Equivalence of operations with respect to discriminator clones ⋮ Generalizations of Świerczkowski's lemma and the arity gap of finite functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The threshold order of a Boolean function
• Dualization of regular Boolean functions
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• An O(m n) algorithm for regular set-covering problems
• Theory of majority decision elements
• On a conjecture of wang and williams
• A Class of Polynomially Solvable Set-Covering Problems
• The threshold weight of a graph
• Two-Processor Scheduling with Start-Times and Deadlines
• An Algorithm to Dualize a Regular Switching Function
• A Theory of Completely Monotonic Functions and its Applications to Threshold Logic

This page was built for publication: Boolean minors