Geometric arguments yield better bounds for threshold circuits and distributed computing
type: Item
instance of: scholarly article
title: Geometric arguments yield better bounds for threshold circuits and distributed computing
zbMATH Open document ID: 0887.68034
DOI: 10.1016/0304-3975(95)00005-4
author: Matthias Krause
published in: Theoretical Computer Science
publication date: 1997-09-09T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1058450
zbMATH Keywords: Boolean functions
zbMATH Keywords: threshold circuit
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00005-4
OpenAlex ID: W2071020383
cites work: Harmonic Analysis of Polynomial Threshold Functions
cites work: Majority gates vs. general weighted threshold gates
cites work: Q3359756
cites work: Realizing Boolean functions on disjoint sets of variables
cites work: Q4038696
cites work: On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
description: scientific article; zbMATH DE number 1058450