scientific article; zbMATH DE number 3990864

zbMATH Open0612.68037MaRDI QIDQ3753482FDOQ3753482

Authors Juraj Hromkovič 

Publication date 1986

zbMATH Keywords

VLSI circuitslanguage recognitionlower bounds on \(AT^ 2\)S-communication complexity

Mathematics Subject Classification ID

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

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 (9)

• Communication complexity hierarchy
• 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
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Lower bounds on communication complexity
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

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)