Representing \((0,1)\)-matrices by Boolean circuits

DOI10.1016/j.disc.2009.07.011zbMath1229.94068OpenAlexW2063242011MaRDI QIDQ1045160

Stasys P. Jukna

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.011

zbMATH Keywords

Hadamard matriceslower boundsBoolean circuitslinear circuitssunflower Lemma

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• On shifting networks
• Superconcentrators of depth 2
• Superconcentrators of depths 2 and 3; odd levels help (rarely)
• Communication in bounded depth circuits
• Some combinatorial-algebraic problems from complexity theory
• Intersection Theorems for Systems of Sets
• Linear Circuits over $\operatorname{GF}(2)$
• Boolean Circuits, Tensor Ranks, and Communication Complexity
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

This page was built for publication: Representing \((0,1)\)-matrices by Boolean circuits