Impossibility results for weak threshold networks

DOI10.1016/S0020-0190(97)00096-3zbMATH Open1337.68106MaRDI QIDQ287142FDOQ287142

Authors: Costas Busch, Marios Mavronicolas 

Publication date: 26 May 2016

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

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

zbMATH Keywords

distributed computingparallel processingimpossibility results

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Two algorithms for barrier synchronization
• Counting networks
• A combinatorial treatment of balancing networks
• Counting networks with arbitrary fan-out
• A lower bound on wait-free counting

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)