Geometric arguments yield better bounds for threshold circuits and distributed computing
Author:
- Matthias KrauseMKMatthias Krause
- 1 March 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 156 (1-2) , 99-117
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Majority gates vs. general weighted threshold gatescomputational complexity, 1992
- Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics, 1990
- Multiparty protocols and logspace-hard pseudorandom sequences1989
- A note on the power of threshold circuits1989
- Relations between communication complexity classes1988
- Threshold circuits of bounded depth1987
- Meanders, Ramsey theory and lower bounds for branching programs1986
- Lower bounds by probabilistic arguments1983
- Realizing Boolean functions on disjoint sets of variablesTheoretical Computer Science, 1976
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elementsMathematical Notes, 1974