scientific article; zbMATH DE number 4108150

zbMATH Open0676.68014MaRDI QIDQ3832044FDOQ3832044

Authors: Juraj Hromkovič 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3905849
• scientific article; zbMATH DE number 4051518
• scientific article; zbMATH DE number 3990864
• The advantages of a new approach to defining the communication complexity for VLSI
• scientific article; zbMATH DE number 1011685

zbMATH Keywords

lower boundscommunication complexityVLSI algorithmsVLSI computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (12)

• The advantages of a new approach to defining the communication complexity for VLSI
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• The advantages of a new approach to defining the communication complexity for VLSI
• Title not available (Why is that?)
• A model of computation for VLSI with related complexity results
• Title not available (Why is that?)
• Energy reduction in VLSI computation modules: an information-theoretic approach
• 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
• A nonlinear lower bound on the practical combinational complexity

This page was built for publication:

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