scientific article; zbMATH DE number 3906394

MaRDI QIDQ3684035zbMATH OpenFDO

Authors William F. McColl

Publication date 1985

zbMATH Keywords

planar circuit sizen-argument Boolean functions

Mathematics Subject Classification ID

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

Cited in

(7)

• The planar realization of Boolean functions
• Planar acyclic computation
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity
• On the complexity of planar Boolean circuits
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• Lower bounds on the area complexity of Boolean 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 Q3684035)