Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,300 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.
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
2008
2008
Linear transformation in Pseudo-Boolean functions
Yong-Hyuk Kim
Annual Conference on Genetic and Evolutionary…
2008
Corpus ID: 20669244
Traditional approaches dealing with pseudo-boolean function mostly use the inherent standard basis. When we consider another…
Expand
2007
2007
Fast algorithms for polynomial representations of boolean functions and pseudo-boolean functions
Wang Ai-lan
2007
Corpus ID: 124432231
Boolean functions and pseudo-Boolean functions have been widely used in different fields,whose polynomial representations…
Expand
2005
2005
Approximating Pseudo-Boolean Functions on Non-Uniform Domains
R. Lax
,
Guoli Ding
,
Peter P. Chen
,
Jianhua Chen
International Joint Conference on Artificial…
2005
Corpus ID: 25915766
In Machine Learning (ML) and Evolutionary Computation (EC), it is often beneficial to approximate a complicated function by a…
Expand
1994
1994
The struction algorithm for the maximum stable set problem revisited
K. Hoke
,
M. Troyon
Discrete Mathematics
1994
Corpus ID: 28452551
1992
1992
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability
Jean-Marie Bourjolly
,
P. Hammer
,
W. Pulleyblank
,
B. Simeone
Computer Science and Operations Research
1992
Corpus ID: 122455254
1987
1987
Roof duality for polynomial 0–1 optimization
Shi-Hui Lu
,
A. Williams
Mathematical programming
1987
Corpus ID: 36819949
The purpose of this note is to generalize the roof duality theory of Hammer, Hansen and Simeone to the case of polynomial 0–1…
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
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…
Expand
1968
1968
Minimization of Linear Pseudo-Boolean Functions
P. Hammer
,
S. Rudeanu
1968
Corpus ID: 124959447
The results of the preceding two chapters will now be used in order to solve pseudo-Boolean programs, that is problems of…
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
or Only Accept Required