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

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

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 complexityVLSI circuitslanguagesVLSI computations

Mathematics Subject Classification ID

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

Cited In (4)

• 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?)
• A nonlinear lower bound on the practical combinational complexity

   Recommendations

• 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?) 👍 👎
• Communication complexity hierarchy 👍 👎
• Title not available (Why is that?) 👍 👎
• An introductory course on communication complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Lower bounds on communication complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)