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

DOI10.1016/0304-3975(88)90165-XzbMATH Open0651.68050OpenAlexW1992687353MaRDI QIDQ5966473FDOQ5966473

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

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

zbMATH Keywords

Boolean functioncommunication complexityVLSI circuitslanguagesVLSI computations

Mathematics Subject Classification ID

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

Cited In (8)

• Communication complexity hierarchy
• Lower bounds on the area complexity of Boolean circuits
• The advantages of a new approach to defining the communication complexity for VLSI
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)