Daiki Yashima

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we consider a biologically-inspired Boolean function P n D that models a simple task of detecting global spatial patterns on a two-dimensional map. We prove that P n D is computable by a threshold circuit of size (i.e., number of gates) O(√ n log n), which is an improvement on the previous upper bound O(n), while our circuit has larger depth(More)
  • 1