Abstract
We construct a sequence of monotone Boolean functions hn:{0, 1}n→{0, 1}n, such that the monotone complexity of hn is of order n2/log n. This result includes the largest known lower bound of this kind. Previously there were an Ω(n3/2) bound for the Boolean matrix product, an Ω(n5/3) bound for Boolean sums and an Ω(n2/log2n) bound of the author for the same functions hn. This new lower bound is proved by new methods which probably will turn out to be useful also for other problems.
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.
