Boolean minors

DOI10.1016/0012-365X(93)E0191-6MaRDI QIDQ1894774zbMATH OpenOpenAlexFDO

Authors 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

Combinatorics in computer science (68R05) Boolean functions (06E30)

Recommendations

• Canalyzing minors of Boolean functions
• Minimally generated Boolean algebras
• Minimal False Quantified Boolean Formulas
• Excluded minors for Boolean polymatroids
• The Minimization Problem for Boolean Formulas
• A minimization method for boolean functions
• scientific article; zbMATH DE number 2210682
• Minimally unsatisfiable Boolean circuits
• scientific article; zbMATH DE number 4179291
• Minimization of Boolean functions in the basis OR-NOT (AND-NOT)

Cites work

• scientific article; zbMATH DE number 3476893 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 617554 (Why is no real title available?)
• scientific article; zbMATH DE number 3266648 (Why is no real title available?)
• scientific article; zbMATH DE number 3329024 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• scientific article; zbMATH DE number 3193192 (Why is no real title available?)
• A Class of Polynomially Solvable Set-Covering Problems
• A Theory of Completely Monotonic Functions and its Applications to Threshold Logic
• An Algorithm to Dualize a Regular Switching Function
• An O(m n) algorithm for regular set-covering problems
• Dualization of regular Boolean functions
• On a conjecture of wang and williams
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• The threshold order of a Boolean function
• The threshold weight of a graph
• Theory of majority decision elements
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(18)

• Clones with finitely many relative \({\mathcal R}\)-classes
• The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
• Algebraic and topological closure conditions for classes of pseudo-Boolean functions
• Decompositions of functions based on arity gap
• Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
• Descending chains and antichains of the unary, linear, and monotone subfunction relations
• On a quasi-ordering on Boolean functions
• Additive decomposability of functions over abelian groups
• Equivalence of operations with respect to discriminator clones
• Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
• Generalizations of Świerczkowski's lemma and the arity gap of finite functions
• On the effect of variable identification on the essential arity of functions on finite sets
• RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS
• Reconstructing permutations from identification minors
• Critical properties and complexity measures of read-once Boolean functions
• Parametrized arity gap
• Canalyzing minors of Boolean functions
• Minimal False Quantified Boolean Formulas

This page was built for publication: Boolean minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894774)