Abstract
AbstractChapter 4 focuses on the expressive power of binary submodular functions. Known and new classes of submodular functions that are expressible by binary submodular functions are presented. There is a close relationship between the expressive power of binary submodular functions and solving submodular valued constraint satisfaction problems via the minimum cut problem: showing that a class \(\mathcal{C}\) of submodular functions is expressible by binary submodular functions is equivalent to showing that functions from \(\mathcal{C}\) can be minimised efficiently via the minimum cut problem.KeywordsSubmodular FunctionCost FunctionBoolean DomainBoolean PolynomialSubmodular ConstraintsThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
