Daiki Yashima

  • Citations Per Year
Learn More
In this paper, we consider a biologically-inspired Boolean function P D that models a simple task of detecting global spatial patterns on a twodimensional map. We prove that P D is computable by a threshold circuit of size (i.e., number of gates) O( √ n logn), which is an improvement on the previous upper bound O(n), while our circuit has larger depth O( √(More)
  • 1