Impossibility results for weak threshold networks

DOI10.1016/S0020-0190(97)00096-3MaRDI QIDQ287142zbMATH OpenFDO

Authors Costas Busch, Marios Mavronicolas

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(97)00096-3

zbMATH Keywords

distributed computingparallel processingimpossibility results

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Threshold circuits of bounded depth
• Size--Depth Tradeoffs for Threshold Circuits
• On the Power of Threshold Circuits with Small Weights
• Approximating threshold circuits by rational functions
• Majority gates vs. general weighted threshold gates

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A combinatorial treatment of balancing networks
• A lower bound on wait-free counting
• Counting networks
• Counting networks with arbitrary fan-out
• Two algorithms for barrier synchronization

Cited in

(1)

• Threshold counters with increments and decrements

This page was built for publication: Impossibility results for weak threshold networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287142)