Algebraic and topological closure conditions for classes of pseudo-Boolean functions

DOI10.1016/j.dam.2009.02.005zbMath1216.06011OpenAlexW2059797267MaRDI QIDQ967323

Stephan Foldes, Peter L. Hammer

Publication date: 28 April 2010

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

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

zbMATH Keywords

closed classespseudo-Boolean functionsmaximal classes

Mathematics Subject Classification ID

Boolean programming (90C09) Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The threshold order of a Boolean function
• Submodular functions and electrical networks
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Boolean minors
• Equational characterizations of Boolean function classes
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Submodular functions and optimization.
• Equivalent Representations of Set Functions
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions

This page was built for publication: Algebraic and topological closure conditions for classes of pseudo-Boolean functions