Abstract
The k-th threshold function, T k n , is defined as: $$T_k^n \left( {x_1 ,...,x_n } \right) = \left\{ \begin{gathered} 1 if \sum\limits_{i = 1}^n {x_i \geqq k} \hfill \\ 0 otherwise \hfill \\ \end{gathered} \right.$$ where x ie{0,1} and the summation is arithmetic. We prove that any monotone network computing T 3/n(x 1,...,x n) contains at least 2.5n-5.5 gates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.