Simulating threshold circuits by majority circuits
From MaRDI portal
Publication:5248525
DOI10.1145/167088.167234zbMath1310.94242MaRDI QIDQ5248525
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
68Q25: Analysis of algorithms and problem complexity
Related Items
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?