Disjunctive analogues of submodular and supermodular pseudo-Boolean functions

DOI10.1016/J.DAM.2003.12.008MaRDI QIDQ1878401zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Stephane Foldes, Peter L. Hammer

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

ConsensusDisjunctive normal formImplicantsPseudo-Boolean functionsResolutionSubmodularitySupermodularity

Mathematics Subject Classification ID

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

Recommendations

• Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions
• Submodular goal value of Boolean functions
• Horn functions and submodular Boolean functions
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Pseudo-Boolean optimization with a disjunctive constraint
• scientific article; zbMATH DE number 3880597
• Supermodular and Tight Set Functions
• Submodular function minimization and maximization in discrete convex analysis
• Submodular functions and independence structures
• Learning Pseudo-Boolean k-DNF and Submodular Functions

Cites work

• 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
• Horn functions and submodular Boolean functions
• scientific article; zbMATH DE number 3599956 (Why is no real title available?)
• scientific article; zbMATH DE number 1543344 (Why is no real title available?)
• scientific article; zbMATH DE number 3212646 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Pseudo-Boolean optimization
• Submodular functions and electrical networks
• Submodular functions and optimization

Cited in

(7)

• Horn functions and submodular Boolean functions
• Submodular goal value of Boolean functions
• Special issue: Boolean functions and related problems
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• On a general framework for network representability in discrete optimization (extended abstract)
• Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions
• Learning Pseudo-Boolean k-DNF and Submodular Functions

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

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