On Decision Tree Complexity of Boolean Function and Yao's Question
Received:October 19, 1999  
Key Words: Boolean function   decision tree   complexity   Rivest-Vuillemin conjecture.  
Fund Project:Supported by the National Natural Science Foundation of China (10171095), Foundation of Chinese Academy of Science (J2001), and Foundation of GSCAS(yzjj200105)
Author NameAffiliation
GAO Sui-xiang Math. Dept.
Graduate School of the Chinese Academy of Sciences
Hua Look-Keng Inst. of Appl. Math
& Info. Sci.
Beijing
China 
YANG De-zhuang Math. Dept.
Graduate School of the Chinese Academy of Sciences
Hua Look-Keng Inst. of Appl. Math
& Info. Sci.
Beijing
China 
Hits: 3039
Download times: 1692
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2002.04.005
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.