scientific article

zbMATH Open0612.68037MaRDI QIDQ3753482

Juraj Hromkovič

Publication date: 1986

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (2)

The advantages of a new approach to defining the communication complexity for VLSI ⋮ Title not available (Why is that?)

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)