Energy and fan-in of threshold circuits computing mod functions

Akira Suzuki, Kei Uchizawa, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we consider a threshold circuit C computing the modulus function MODm , and investigate a relationship between two complexity measures, fan-in l and energy e of C, where the fan-in l is defined to be the maximum number of inputs of every gate in C, and the energy e to be the maximum number of gates outputting "1" over all inputs to C. We first prove that MODm of n variables can be computed by a threshold circuit of fan-in l and energy e = O (n/l), and then provide an almost tight lower bound e = Ω((n - m)/l). Our results imply that there exists a tradeoff between the fan-in and energy of threshold circuits computing the modulus function.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
Pages154-163
Number of pages10
DOIs
Publication statusPublished - 2011
Event8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
Duration: 2011 May 232011 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6648 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
CountryJapan
CityTokyo
Period11/5/2311/5/25

Keywords

  • Boolean function
  • MOD function
  • energy complexity
  • fan-in
  • threshold circuit

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Energy and fan-in of threshold circuits computing mod functions'. Together they form a unique fingerprint.

Cite this