The Expressive Power of Binary Submodular Functions

@article{Zivny2009TheEP,
  title={The Expressive Power of Binary Submodular Functions},
  author={Stanislav Zivny and David A. Cohen and Peter Jeavons},
  journal={Discrete Applied Mathematics},
  year={2009},
  volume={157},
  pages={3347-3358}
}
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. Using a connection between the expressive power of valued constraints and certain algebraic properties of functions, we answer this question… CONTINUE READING
Highly Cited
This paper has 71 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
39 Citations
55 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

72 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 55 references

Graphical models, exponential families, and variational inference

  • M. J. Wainwright, M. I. Jordan
  • Technical Report 649, UC Berkeley, Dept. of…
  • 2003
Highly Influential
4 Excerpts

Complexity Classification of Boolean Constraint Satisfaction Problems

  • N. Creignou, S. Khanna, M. Sudan
  • Volume 7 of SIAM Monographs on Discrete…
  • 2001
Highly Influential
4 Excerpts

Graphical Models

  • S. L. Lauritzen
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…