Skip to search formSkip to main contentSkip to account menu

Pseudo-Boolean function

Known as: Roof duality 
In mathematics and optimization, a pseudo-Boolean function is a function of the form , where B = {0, 1} is a Boolean domain and n is a nonnegative… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Mathematical optimization
Maximum cutPolynomialSubmodular set functionSupermodular function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Stochastic Relaxation as a Unifying Approach in 0/1 Programming
Poster. NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & P 
2008
2008
Linear transformation in Pseudo-Boolean functions
Traditional approaches dealing with pseudo-boolean function mostly use the inherent standard basis. When we consider another… 
2007
2007
Fast algorithms for polynomial representations of boolean functions and pseudo-boolean functions
Boolean functions and pseudo-Boolean functions have been widely used in different fields,whose polynomial representations… 
2005
2005
Approximating Pseudo-Boolean Functions on Non-Uniform Domains
In Machine Learning (ML) and Evolutionary Computation (EC), it is often beneficial to approximate a complicated function by a… 
1994
1994
The struction algorithm for the maximum stable set problem revisited
1992
1992
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability
1987
1987
Roof duality for polynomial 0–1 optimization
The purpose of this note is to generalize the roof duality theory of Hammer, Hansen and Simeone to the case of polynomial 0–1… 
1974
1974
On the Solution of Boolean and Pseudo-Boolean Relations
This correspondence deals with collections of n binary relations between Boolean and/or pseudo-Boolean functions which are… 
1974
1974
A note on the monotonicity of pseudo-Boolean functions
  • P. Hammer
  • Z. Oper. Research
  • 1974
  • Corpus ID: 35511495
SummaryRecentlyWilde andSanchez-Anton [1971] have studied monotonically increasing pseudo-Boolean functions, and have given a… 
1968
1968
Minimization of Linear Pseudo-Boolean Functions
The results of the preceding two chapters will now be used in order to solve pseudo-Boolean programs, that is problems of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)