Abstract
This paper addresses the problem of symbolic optimization of functions defined over finite discrete sets. In connection with the main goal of the paper, several interesting properties of Boolean functions are discovered, related to a particular function representation, over the vertices of hyper-cube { - 1 , 1 } k . The symbolic algorithm which is proposed has essentially the same computational complexity as the classical search methods, with the advantage of its possible application to parametric optimization.
Sign-in/Register to access full text options 
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.
