On the power of circuits with gates of low \(L_{1}\) norms.
type: Item
instance of: scholarly article
title: On the power of circuits with gates of low \(L_{1}\) norms.
zbMATH Open document ID: 1053.68575
DOI: 10.1016/S0304-3975(96)00290-3
author: Vince Grolmusz
published in: Theoretical Computer Science
publication date: 1998-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1170322
MaRDI profile type: Publication
cites work: The expressive power of voting polynomials
cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
cites work: Representing Boolean functions as polynomials modulo composite numbers
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Majority gates vs. general weighted threshold gates
cites work: Q4036606
cites work: Harmonic analysis, real approximation, and the communication complexity of Boolean functions
cites work: A weight-size trade-off for circuits with MOD \(m\) gates
cites work: Q4259977
cites work: Q4230350
cites work: Threshold circuits of bounded depth
cites work: On the power of small-depth threshold circuits
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Constant depth circuits, Fourier transform, and learnability
cites work: Q4284623
cites work: On the degree of Boolean functions as real polynomials
cites work: Monotone circuits for matching require linear depth
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: Q4038696
cites work: Q5606305
full work available at URL: s0304-3975(96)00290-3
OpenAlex ID: W2057810289
description: scientific article; zbMATH DE number 1170322