Simulating Threshold Circuits by Majority Circuits
From MaRDI portal
Publication:4388870
DOI10.1137/S0097539794274519zbMath0912.68030MaRDI QIDQ4388870
Mikael Goldmann, Marek Karpinski
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Monotone Boolean formulas can approximate monotone linear threshold functions ⋮ Powering requires threshold depth 3 ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ A Short List of Equalities Induces Large Sign-Rank ⋮ Decomposition of threshold functions into bounded fan-in threshold functions ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ Quantum matchgate computations and linear threshold gates ⋮ A new theorem in threshold logic and its application to multioperand binary adders ⋮ Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression ⋮ Monotone circuits for monotone weighted threshold functions
This page was built for publication: Simulating Threshold Circuits by Majority Circuits
