scientific article; zbMATH DE number 2032366

zbMATH Open1033.94573MaRDI QIDQ4446212FDOQ4446212

S. V. Gribok

Publication date: 26 January 2004

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

Recommendations

• scientific article; zbMATH DE number 4189653
• Publication:3197772
• On a model of plane contact schemes
• A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
• Lower bounds on the area complexity of Boolean circuits

zbMATH Keywords

netarea complexityplanar circuitcellular circuit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding theorems (Shannon theory) (94A24) Applications of graph theory to circuits and networks (94C15)

Cited In (1)

• Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model

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 Q4446212)