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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Use of higher order clique potentials for modeling inference problems has exploded in last few years. The algorithmic schemes… 
Review
2014
Review
2014
“[...] any system of propositions may be expressed by equations involving symbols x,y,z, which, whenever interpretation is… 
2009
2009
Poster. NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & P 
2009
2009
Let f : {0, 1}n → R be a pseudo-Boolean function and let f̂ : [0, 1] → R denote the Lovász extension of f . We show that the best… 
2008
2008
We address the problem of energy minimization, which is (1) generally NP-complete and (2) involves many discrete variables… 
2008
2008
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been… 
2006
2006
We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the… 
2004
2004
In this paper, we present a new framework for learning pseudo-Boolean functions from training data. The new learning framework is… 
1992
1992
This thesis reports on a series of studies concerning on the one hand, classes of structured Boolean functions, and on the other… 
1974
1974
This correspondence deals with collections of n binary relations between Boolean and/or pseudo-Boolean functions which are…