Simulating threshold circuits by majority circuits

DOI10.1145/167088.167234MaRDI QIDQ5248525zbMATH OpenOpenAlexFDO

Authors Mikael Goldmann, Marek Karpinski

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167234

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• On the computational power of depth-2 circuits with threshold and modulo gates
• Threshold circuits of small majority-depth
• Can large fanin circuits perform reliable computations in the presence of faults?
• A note on the simulation of exponential threshold weights
• Circuit complexity before the dawn of the new millennium

This page was built for publication: Simulating threshold circuits by majority circuits

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