Simulating threshold circuits by majority circuits

Abstract

We prove that a single threshold gate can be simulated by an explicit polynomial-size depth 2 majority circuit. In general we show that a depth d threshold circuit can be simulated uniformly by a majority circuit of depth d + 1. Goldmann, H%tad, and .Razborov showed in [9] that a non-uniform simulation exists. Our construction answers two open questions… (More)
DOI: 10.1145/167088.167234

Topics

Statistics

0510'96'99'02'05'08'11'14'17
Citations per Year

88 Citations

Semantic Scholar estimates that this publication has 88 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Goldmann1993SimulatingTC, title={Simulating threshold circuits by majority circuits}, author={Mikael Goldmann and Marek Karpinski}, journal={SIAM J. Comput.}, year={1993}, volume={27}, pages={230-246} }