scientific article; zbMATH DE number 19782

MaRDI QIDQ3979282zbMATH OpenFDO

Authors Juraj Waczulík

Publication date 26 June 1992

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• 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 (Why is no real title available?)
• scientific article; zbMATH DE number 4057005 (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 Q3979282)