Abstract
The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis Open image in new window , which is the Sheffer stroke. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuits realizing a linear function.
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.
