Representing \((0,1)\)-matrices by Boolean circuits
type: Item
instance of: scholarly article
title: Representing \((0,1)\)-matrices by Boolean circuits
zbMATH Open document ID: 1229.94068
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 15B34
Mathematics Subject Classification ID: 05B20
zbMATH DE Number: 5648185
zbMATH Keywords: Boolean circuits
zbMATH Keywords: linear circuits
zbMATH Keywords: Hadamard matrices
zbMATH Keywords: lower bounds
zbMATH Keywords: sunflower Lemma
author: Stasys Jukna
MaRDI profile type: MaRDI publication profile
full work available at URL: j.disc.2009.07.011
OpenAlex ID: W2063242011
cites work: Superconcentrators of depths 2 and 3; odd levels help (rarely)
cites work: Linear Circuits over $\operatorname{GF}(2)$
cites work: Q3412385
cites work: Intersection Theorems for Systems of Sets
cites work: Superconcentrators of depth 2
cites work: Communication in bounded depth circuits
cites work: On shifting networks
cites work: Some combinatorial-algebraic problems from complexity theory
cites work: Boolean Circuits, Tensor Ranks, and Communication Complexity
cites work: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
cites work: Q4164821
DOI: 10.1016/J.DISC.2009.07.011
Recommended article: MATRIX REPRESENTATIONS OF BOOLEAN FUNCTIONS AND THEIR APPLICATION
Recommended article: On circulant Boolean matrices
Recommended article: Q4729719
Recommended article: Q5514082
Recommended article: Boolean matrices and their applications to covering reductions
Recommended article: Q3209256
Recommended article: Q5177920
Recommended article: On a family of Boolean matrices
Recommended article: Q4025153
description: scientific article; zbMATH DE number 5648185