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

DOI10.1016/0304-3975(88)90165-XzbMath0651.68035OpenAlexW1992687353MaRDI QIDQ1106661

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)

Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Communication complexity
• Communication complexity hierarchy

This page was built for publication: The advantages of a new approach to defining the communication complexity for VLSI