scientific article; zbMATH DE number 4108150

MaRDI QIDQ3832044zbMATH OpenFDO

Authors Juraj Hromkovič

Publication date 1989

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)

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

Cited in

(12)

• A nonlinear lower bound on the practical combinational complexity
• 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
• The advantages of a new approach to defining the communication complexity for VLSI
• scientific article; zbMATH DE number 4102489 (Why is no real title available?)
• A model of computation for VLSI with related complexity results
• scientific article; zbMATH DE number 3905849 (Why is no real title available?)
• Energy reduction in VLSI computation modules: an information-theoretic approach
• scientific article; zbMATH DE number 4135399 (Why is no real title available?)
• scientific article; zbMATH DE number 4051518 (Why is no real title available?)
• scientific article; zbMATH DE number 3990864 (Why is no real title available?)
• 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)