scientific article; zbMATH DE number 3990864

MaRDI QIDQ3753482zbMATH OpenFDO

Authors Juraj Hromkovič

Publication date 1986

zbMATH Keywords

language recognitionlower bounds on \(AT^ 2\)S-communication complexityVLSI circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• 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 3905849
• Communication complexity hierarchy
• scientific article; zbMATH DE number 4108150

Cited in

(10)

• Communication complexity hierarchy
• Lower bounds on communication complexity
• The advantages of a new approach to defining the communication complexity for VLSI
• scientific article; zbMATH DE number 3905849 (Why is no real title available?)
• scientific article; zbMATH DE number 4026854 (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 4112041 (Why is no real title available?)
• scientific article; zbMATH DE number 19782 (Why is no real title available?)
• The advantages of a new approach to defining the communication complexity for VLSI

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 Q3753482)