Presentation 2001/10/12
On the Computational Power of a Family of Decision Forests
Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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 ƒ, Beigel and Hirst (STOC'98) showed that ⌊log_2k⌋+1 help bits are necessary to reduce the complexity of ƒ, for any function ƒ, and exhibit the functions for which ⌊log_2k⌋+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 conditions whose complexity are only 2√. We also investigate the help bit problem when we are only allowed to use decision trees of depth 1. Moreover, we exhibit the close relationship between the help bit problem and the complexity for circuits with a majority gate at the top.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) decision tree / Boolean function / help bit / cover problem / approximation / threshold circuit
Paper # COMP 2001-51
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/10/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Computational Power of a Family of Decision Forests
Sub Title (in English)
Keyword(1) decision tree
Keyword(2) Boolean function
Keyword(3) help bit
Keyword(4) cover problem
Keyword(5) approximation
Keyword(6) threshold circuit
1st Author's Name Kazuyuki Amano
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Tsukuru Hirosawa
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Yusuke Watanabe
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
4th Author's Name Akira Maruoka
4th Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2001/10/12
Paper # COMP 2001-51
Volume (vol) vol.101
Number (no) 376
Page pp.pp.-
#Pages 8
Date of Issue