scientific article; zbMATH DE number 139639

zbMATH Open0782.94019MaRDI QIDQ4029620FDOQ4029620

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

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

lower boundBoolean functioncombinational circuit

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• A Note on the Space Complexity of Fast D-Finite Function Evaluation
• Asymptotically Optimal Circuit for a Storage Access Function
• Title not available (Why is that?)
• Sharp lower bounds involving circuit layout system
• Title not available (Why is that?)

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)