scientific article

zbMATH Open0673.68031MaRDI QIDQ3827544

Juraj Hromkovič

Publication date: 1988

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

zbMATH Keywords

lower boundscomplexity of Boolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ 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 Q3827544)