Threshold circuits for global patterns in 2-dimensional maps

Kei Uchizawa, Daiki Yashima, Xiao Zhou

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

1 Citation (Scopus)


In this paper, we consider a biologically-inspired Boolean function, called Pn D, which models a task for detecting specific global spatial arrangements of local visual patterns on a 2-dimensional map. We prove that Pn D is computable by a threshold circuit of size O(√ n log n), which is improvement on the previous upper bound O(n). We also show that the size of our circuit is almost optimal up to logarithmic factor: we show that any threshold circuit computing Pn D needs size Ω(√ n/ log n).

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 9th InternationalWorkshop,WALCOM 2015, Proceedings
EditorsM. Sohel Rahman, Etsuji Tomita
PublisherSpringer Verlag
Number of pages11
ISBN (Electronic)9783319156118
Publication statusPublished - 2015
Event9th International Workshop on Algorithms and Computation, WALCOM 2015 - Dhaka, Bangladesh
Duration: 2015 Feb 262015 Feb 28

Publication series

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


Other9th International Workshop on Algorithms and Computation, WALCOM 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Threshold circuits for global patterns in 2-dimensional maps'. Together they form a unique fingerprint.

Cite this