Disjunctive analogues of submodular and supermodular pseudo-Boolean functions

DOI10.1016/j.dam.2003.12.008zbMath1051.06010OpenAlexW2091612924MaRDI QIDQ1878401

Yanyan Li

Publication date: 19 August 2004

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

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

zbMATH Keywords

SupermodularityConsensusResolutionSubmodularityPseudo-Boolean functionsDisjunctive normal formImplicants

Mathematics Subject Classification ID

Functional inequalities, including subadditivity, convexity, etc. (39B62) Boolean functions (06E30)

Related Items (2)

Special issue: Boolean functions and related problems ⋮ Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Cites Work

• Pseudo-Boolean optimization
• Submodular functions and optimization
• Submodular functions and electrical networks
• Horn functions and submodular Boolean functions
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Disjunctive and conjunctive representations in finite lattices and convexity spaces
• Equational characterizations of Boolean function classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctive analogues of submodular and supermodular pseudo-Boolean functions