SENSITIVITY VS BLOCK SENSITIVITY OF BOOLEAN FUNCTIONS

被引:30
作者
RUBINSTEIN, D
机构
关键词
D O I
10.1007/BF01200762
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Sensitivity and block sensitivity are important measures of complexity of Boolean functions. In this note we exhibit a Boolean function of n variables that has sensitivity O(root n) and block sensitivity Omega(n). This demonstrates a quadratic separation of the two measures.
引用
收藏
页码:297 / 299
页数:3
相关论文
共 7 条
[1]  
COOK, UK
[2]   UPPER AND LOWER TIME-BOUNDS FOR PARALLEL RANDOM-ACCESS MACHINES WITHOUT SIMULTANEOUS WRITES [J].
COOK, S ;
DWORK, C ;
REISCHUK, R .
SIAM JOURNAL ON COMPUTING, 1986, 15 (01) :87-97
[3]  
GAL A, 1991, 32ND IEEE S F COMP S, P594
[4]  
NISAN N, 1992, 24TH P ACM S THEOR C, P462
[5]  
NISAN N, 1989, 21ST P ACM S THEOR C, P327
[6]  
SIMON HU, 1983, LECT NOTES COMPUT SC, V158, P439
[7]  
WEGENER I, 1987, COMPLEXITY BOOLEAN F, P373