The computational power of a family of decision forests
K Amano, T Hirosawa, Y Watanabe… - … Foundations of Computer …, 2001 - Springer
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⌊ log 2 k⌋+ 1 help bits are necessary to reduce the
complexity of f, for any function f, and exhibit the functions for which⌊ log 2 k⌋+ 1 help bits
reduce the complexity. Their functions must satisfy the condition that their complexity is
greater than or equal to k-1. In this paper, we show new functions satisfying the above …
Nisan, Rudich and Saks (FOCS'94). When computing k instances of a Boolean function f,
Beigel and Hirst (STOC'98) showed that⌊ log 2 k⌋+ 1 help bits are necessary to reduce the
complexity of f, for any function f, and exhibit the functions for which⌊ log 2 k⌋+ 1 help bits
reduce the complexity. Their functions must satisfy the condition that their complexity is
greater than or equal to k-1. In this paper, we show new functions satisfying the above …
[CITATION][C] On the Computational Power of a Family of Decision Forests
天野一幸， 廣澤創， 渡邉佑介 - 電子情報通信学会技術研究報告= IEICE …, 2001 - cir.nii.ac.jp
On the Computational Power of a Family of Decision Forests | CiNii Research … On the
Computational Power of a Family of Decision Forests …
Computational Power of a Family of Decision Forests …
Showing the best results for this search. See all results