Abstract
We introduce the notion of reflexive-recursive circuits and consider classes of many-output and scalar reflexive-recursive circuits of bounded depth in an arbitrary basis. Methods are proposed for deriving lower and upper bounds on the Shannon function for the complexity of circuits from these classes and asymptotic expressions are established. We also derive upper bounds for the realization complexity in these classes of circuits for some functions and systems of functions occurring in applications.
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.
