Communication complexity hierarchy

DOI10.1016/0304-3975(86)90087-3zbMath0621.68035OpenAlexW2027620237MaRDI QIDQ1090456

Juraj Hromkovič

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90087-3

zbMATH Keywords

lower boundsVLSI circuitsarea complexityarea-time squared complexityCommunication complexity of languagescomputational complexity of language recognition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

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

Cites Work

• Area-time tradeoffs for matrix multiplication and related problems in VLSI models

This page was built for publication: Communication complexity hierarchy