The advantages of a new approach to defining the communication complexity for VLSI
From MaRDI portal
Publication:5966473
DOI10.1016/0304-3975(88)90165-XzbMath0651.68050OpenAlexW1992687353MaRDI QIDQ5966473
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90165-x
Related Items (2)
A nonlinear lower bound on the practical combinational complexity ⋮ Lower bounds on the area complexity of Boolean circuits
This page was built for publication: The advantages of a new approach to defining the communication complexity for VLSI