The advantages of a new approach to defining the communication complexity for VLSI

DOI10.1016/0304-3975(88)90165-XzbMath0651.68050OpenAlexW1992687353MaRDI QIDQ5966473

Juraj Hromkovič

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

zbMATH Keywords

Boolean functionVLSI circuitscommunication complexitylanguagesVLSI computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analytic circuit theory (94C05)

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