scientific article; zbMATH DE number 139639

MaRDI QIDQ4029620zbMATH OpenFDO

Authors S. A. Lozhkin, Andrej I. Rybko, Yu. Khromkovich, N. A. Shkalikova, Alexander Sapozhenko

Publication date 28 March 1993

zbMATH Keywords

Boolean functioncombinational circuitlower bound

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Lower bounds on the area complexity of Boolean circuits
• A nonlinear lower bound on the practical combinational complexity
• scientific article; zbMATH DE number 4172915
• scientific article; zbMATH DE number 4102490
• scientific article; zbMATH DE number 4104386

Cited in

(7)

• Sharp lower bounds involving circuit layout system
• A Note on the Space Complexity of Fast D-Finite Function Evaluation
• scientific article; zbMATH DE number 4172915 (Why is no real title available?)
• scientific article; zbMATH DE number 4102490 (Why is no real title available?)
• Asymptotically Optimal Circuit for a Storage Access Function
• scientific article; zbMATH DE number 165471 (Why is no real title available?)
• Asymptotic estimates of a high degree of accuracy for the complexity of a universal multipole in a model of cellular circuits

This page was built for publication:

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