Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,845,841 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Mathematical optimization
Maximum cut
Polynomial
Submodular set function
Supermodular function
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems
Chetan Arora
,
Subhashis Banerjee
,
P. Kalra
,
S. Maheshwari
IEEE Conference on Computer Vision and Pattern…
2014
Corpus ID: 7172078
Use of higher order clique potentials for modeling inference problems has exploded in last few years. The algorithmic schemes…
Expand
Review
2014
Review
2014
Review of boolean functions: theory, algorithms, and applications by Yves Crama and Peter L. Hammer
Y. Crama
,
Peter L. Hammer
SIGA
2014
Corpus ID: 263864330
“[...] any system of propositions may be expressed by equations involving symbols x,y,z, which, whenever interpretation is…
Expand
2009
2009
Stochastic Relaxation as a Unifying Approach in 0/1 Programming
Luigi Malagò
,
M. Matteucci
,
Giovanni Pistone
Neural Information Processing Systems
2009
Corpus ID: 60585385
Poster. NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & P
2009
2009
Pseudo-Boolean Functions , Lovász Extensions , and Beta Distributions ⋆ Guoli
Ding R. F. Lax
2009
Corpus ID: 17776841
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…
Expand
2008
2008
LP-relaxation of Binarized Energy Minimization ( Version 1 . 50 )
A. Shekhovtsov
,
V. Kolmogorov
,
Pushmeet Kohli
,
C. Rother
,
Philip H. S. Torr
2008
Corpus ID: 15877184
We address the problem of energy minimization, which is (1) generally NP-complete and (2) involves many discrete variables…
Expand
2008
2008
Which submodular functions are expressible using binary submodular functions
Stanislav Živný
2008
Corpus ID: 15169590
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been…
Expand
2006
2006
RRR 10 – 2006 , April , 2006 Preprocessing of Unconstrained Quadratic Binary Optimization
E. Boros
,
P. Hammer
,
Gabriel Tavares
2006
Corpus ID: 14628012
We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the…
Expand
2004
2004
A new method for learning pseudo-Boolean functions with applications in terrorists profiling
Jianhua Chen
,
Peter P. Chen
,
Guoli Ding
,
R. Lax
International Conference on Computational…
2004
Corpus ID: 17606370
In this paper, we present a new framework for learning pseudo-Boolean functions from training data. The new learning framework is…
Expand
1992
1992
Combinatorial algorithms for Boolean and pseudo-Boolean functions
Xiaorong Sun
1992
Corpus ID: 124498416
This thesis reports on a series of studies concerning on the one hand, classes of structured Boolean functions, and on the other…
Expand
1974
1974
On the Solution of Boolean and Pseudo-Boolean Relations
G. Klir
IEEE transactions on computers
1974
Corpus ID: 1212118
This correspondence deals with collections of n binary relations between Boolean and/or pseudo-Boolean functions which are…
Expand
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)
ACCEPT & CONTINUE