Asymptotically Optimal Circuit for a Storage Access Function

DOI10.1109/TC.1980.1675657MaRDI QIDQ3880756zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1980.1675657

zbMATH Keywords

Boolean functioncombinational complexityrandom-access storagereading operation

Mathematics Subject Classification ID

Recommendations

• On the depth of the storage access function
• scientific article; zbMATH DE number 139639
• Realization of functions in P_k by circuits of functional elements over an arbitrary basis
• Asymptotic behavior of the Shannon function for a class of circuits of functional elements.
• The complexity of word circuits

Cited in

(4)

• On the depth of the storage access function
• The complexity of the standard multiplexer function in a class of switching circuits
• A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
• A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds

This page was built for publication: Asymptotically Optimal Circuit for a Storage Access Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880756)