Abstract
In this note, we consider the problem of maximizing an arbitrary Boolean polynomial of degree n. We “linearize” the problem and give a complete linear description of the resulting polytope. By examining the dual of the corresponding linear program, we find that the problem of maximizing an arbitrary set function defined on the set \\s{1,..., n\\s} is in one-to-one correspondence with our problem. Moreover, a known result concerning the polynomial solvability of quadratic Boolean functions is generalized to arbitrary Boolean polynomials.
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.
