Multiple cuts, input repetition, and VLSI complexity

DOI10.1016/0020-0190(87)90194-3zbMath0632.68045OpenAlexW2171080370MaRDI QIDQ1095662

Peter Hochschild

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90194-3

zbMATH Keywords

lower boundscomplexity of VLSI circuitsmultiple cut methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

On the complexity of planar Boolean circuits

Cites Work

• Unnamed Item

This page was built for publication: Multiple cuts, input repetition, and VLSI complexity