scientific article

zbMath0735.68045MaRDI QIDQ3979282

Juraj Waczulík

Publication date: 26 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

closure propertiesarea complexity of Boolean circuitscommunication complexity of languagescomplexity measures of VLSI circuits

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The advantages of a new approach to defining the communication complexity for VLSI

This page was built for publication: