Energy Complexity and Depth of Threshold Circuits

Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they have completely different physical meanings. Suppose that a Boolean function f can be computed by a threshold circuit C of energy complexity e and hence at most e threshold gates in C output “1” for any input to C. We then prove that the function f can be computed also by a threshold circuit C of depth

• Type: Conference
• Year: 2009
• Where: FCT
• Authors: Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
• Keywords: Boolean Function, Energy Complexity, FCT 2009, Theoretical Computer Science, Threshold Circuit