Searching for authors named "Yusuke Watanabe" – sorted by Relevance.
-
The Computational Power of a Family of Decision Forests
- . In this paper, we consider the help bit problem in the decision tree model proposed by Nisan, Rudich and Saks (FOCS '94). When computing k instances of a Boolean function f , Beigel and Hirst (STOC '98) showed that blog 2 kc + 1 help bits are necessary to reduce the complexity of f , for any funct
- Add To MetaCart

