Size and Energy of Threshold Circuits Computing Mod Functions

Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input x ∈ {0, 1}n to

• Type: Conference
• Year: 2009
• Where: MFCS
• Authors: Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
• Keywords: Boolean Function Modm, MFCS 2009, Theoretical Computer Science, Threshold Logic Circuit