Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity

  • Authors:

  • Kei Uchizawa;Eiji Takimoto

  • Affiliations:

  • Graduate School of Information Sciences, Tohoku University, 6-3-09, Aramaki aza Aoba, Aoba-ku, Sendai 980-8579, Japan;Department of Informatics, Faculty/Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

A complexity measure for threshold circuits, called the energy complexity, has been proposed to measure an amount of energy consumed during computation in the brain. Biological neurons need more energy to transmit a ''spike'' than not to transmit one, and hence the energy complexity of a threshold circuit is defined as the number of gates in the circuit that output ''1'' during computation. Since the firing activity of neurons in the brain is quite sparse, the following question arises: what Boolean functions can or cannot be computed by threshold circuits with small energy complexity. In the paper, we partially answer the question, that is, we show that there exists a trade-off among three complexity measures of threshold circuits: the energy complexity, size, and depth. The trade-off implies an exponential lower bound on the size of constant-depth threshold circuits with small energy complexity for a large class of Boolean functions.