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

DOI10.1016/0304-3975(88)90165-XMaRDI QIDQ5966473zbMATH OpenOpenAlexFDO

Authors 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 functioncommunication complexitylanguagesVLSI circuitsVLSI computations

Mathematics Subject Classification ID

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

Recommendations

• The advantages of a new approach to defining the communication complexity for VLSI
• scientific article; zbMATH DE number 3990864
• scientific article; zbMATH DE number 19782
• Communication complexity hierarchy
• scientific article; zbMATH DE number 1011685
• An introductory course on communication complexity
• scientific article; zbMATH DE number 4197419
• Lower bounds on communication complexity
• scientific article; zbMATH DE number 4108150
• scientific article; zbMATH DE number 1361468

Cited in

(9)

• Communication complexity hierarchy
• The advantages of a new approach to defining the communication complexity for VLSI
• Lower bounds on the area complexity of Boolean circuits
• scientific article; zbMATH DE number 3905849 (Why is no real title available?)
• scientific article; zbMATH DE number 3990864 (Why is no real title available?)
• scientific article; zbMATH DE number 4051518 (Why is no real title available?)
• scientific article; zbMATH DE number 4108150 (Why is no real title available?)
• scientific article; zbMATH DE number 19782 (Why is no real title available?)
• A nonlinear lower bound on the practical combinational complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5966473)