scientific article; zbMATH DE number 3906394

zbMATH Open0567.94015MaRDI QIDQ3684035FDOQ3684035

Authors: William F. McColl 

Publication date: 1985

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

Recommendations

• On the complexity of planar Boolean circuits
• Lower bounds for synchronous circuits and planar circuits
• scientific article; zbMATH DE number 4104386
• Lower bounds on the area complexity of Boolean circuits
• scientific article; zbMATH DE number 3906395

zbMATH Keywords

planar circuit sizen-argument Boolean functions

Mathematics Subject Classification ID

Cited In (7)

• The planar realization of Boolean functions
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• Lower bounds on the area complexity of Boolean circuits
• Planar acyclic computation
• On the complexity of planar Boolean circuits
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity

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