Abstract
We study the complexity of realization of Boolean functions by circuits of functional gates over the infinite basis AC consisting of all antichain Boolean functions, i.e.,the functions taking the value 1 only at pairwise incomparable tuples. It is shown thatas n → ∞ the complexity of realization of a linear function of n arguments over thebasis AC grows at least as (n/ log n)1/2. It is established that the maximal complexity of realization of Boolean functions of n arguments over the basis AC grows at least as (n/log n)1/2 and at most as n.
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.
