The complexity of depth-two information networks

DOI10.3103/S0027132209010045MaRDI QIDQ2513042zbMATH OpenFDO

Authors D. Yu. Cherukhin

Publication date 2 February 2015

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132209010045

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Entropy of operators or why matrix multiplication is hard for depth-two circuits
• scientific article; zbMATH DE number 5077418
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
• scientific article; zbMATH DE number 176876

Cites work

• Boolean Circuits, Tensor Ranks, and Communication Complexity
• scientific article; zbMATH DE number 5077418 (Why is no real title available?)
• On shifting networks

Cited in

(1)

• Depth of Reasoning and Information Revelation: An Experiment on the Distribution of k-Levels

This page was built for publication: The complexity of depth-two information networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513042)