Fetching the paper…
Reading the bibliography…
A pseudo-Boolean function is a real-valued function $f(x)=f(x_1,x_2,\ldots,x_n)$ of $n$ binary variables; that is, a mapping from $\{0,1\}^n$ to $\mathbb{R}$.
I.G. Rosenberg, Reduction of bivalent maximization to the quadratic case, Cahiers du Centre d’Etudes de Recherche Opérationnelle
1975
Earlier work this paper cites.
M. Minsky and S. Papert, Perceptrons , MIT Press, Cambridge, MA., 1969. (Expanded edition 1988.)
1988
Earlier work this paper cites.
C. Wang and A.C. Williams, The threshold order of a Boolean function, Discrete Applied Mathematics
1991
Earlier work this paper cites.
M. Saks, Slicing the hypercube, in: K. Walker, ed., Surveys in Combinatorics
1993
Earlier work this paper cites.
K.-Y. Siu, V. Roychowdhury and T. Kailath, Discrete Neural Computation: A Theoretical Foundation , Prentice Hall, NJ, 1995
1995
Earlier work this paper cites.
R. Impagliazzo, R. Paturi, M. E. Saks, Size-depth tradeoffs for threshold circuits, SIAM Journal on Computing 26(3) (1997) 693–707
1997
Earlier work this paper cites.
Y. Boykov, O. Veksler and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence
2001
Cited alongside, same era.
V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2) (2004) 147–159
2004
Cited alongside, same era.
D. Freedman and P. Drineas, Energy minimization via graph cuts: Settling what is possible, in: IEEE Conference on Computer Vision and Pattern Recognition
2005
Cited alongside, same era.
V. Kolmogorov and C. Rother, Minimizing non-submodular functions with graph cuts - a review, IEEE Transactions on Pattern Analysis and Machine Intelligence
2007
Cited alongside, same era.
C. Rother, V. Kolmogorov, V. Lempitsky and M. Szummer, Optimizing binary MRFs via extended roof duality, in: IEEE Conference on Computer Vision and Pattern Recognition
Y. Crama and P.L. Hammer, Boolean Functions: Theory, Algorithms, and Applications , Cambridge University Press, New York, N.Y., 2011
2011
Later among the works it cites.
A. Fix, Reductions for rewriting QPBFs with spanning trees, Unpublished notes, 2011
2011
Later among the works it cites.
A. Fix, A. Gruber, E. Boros and R. Zabih, A graph cut algorithm for higher-order Markov random fields, in: Proceedings of the 2011 IEEE International Conference on Computer Vision (ICCV) (2011) pp. 1020–1027
2011
Later among the works it cites.
H. Ishikawa, Transformation of general binary MRF minimization to the first-order case, IEEE Transactions on Pattern Analysis and Machine Intelligence 33(6) (2011) 1234–1249
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
C. Rother, P. Kohli, W. Feng and J. Jia, Minimizing sparse higher order energy functions of discrete variables, in: IEEE Conference on Computer Vision and Pattern Recognition
2009
Cited alongside, same era.
M. Anthony, E. Boros, Y. Crama and M. Gruber, Quadratic reformulations of nonlinear binary optimization problems. In preparation
Cited in the paper.
2011
Later among the works it cites.
E. Boros and A. Gruber, On quadratization of pseudo-Boolean functions, International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11 (2012)
2012
Later among the works it cites.