COMMUNICATION IN BOUNDED DEPTH CIRCUITS

被引:47
作者
PUDLAK, P [1 ]
机构
[1] AVCR,MATEMAT USTAV,CS-11567 PRAGUE 1,CZECH REPUBLIC
关键词
AMS subject classification code (1991): 68R10; 05C35;
D O I
10.1007/BF01215351
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that rigidity of matrices can be used to prove lower bounds on depth 2 circuits and communication graphs. We prove a general nonlinear bound on a certain type of circuits and thus, in particular, we determine the asymptotic size of depth d superconcentrators for all depths greater-than-or-equal-to 4 (for even depths greater-than-or-equal-to 4 it has been determined before).
引用
收藏
页码:203 / 216
页数:14
相关论文
共 10 条
[1]   SUPERCONCENTRATORS OF DEPTH-2 AND DEPTH-3 - ODD LEVELS HELP (RARELY) [J].
ALON, N ;
PUDLAK, P .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (01) :194-202
[2]  
DOLEV D, 1983, 15TH P ANN ACM S THE, P42
[3]   SUPERCONCENTRATORS OF DEPTH-2 [J].
PIPPENGER, N .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (01) :82-90
[4]  
PIPPENGER N, 1981, SIAM J ALG DISC METH, V3, P411
[5]  
PIPPENGER N, 1990, HDB THEORETICAL COMP, P806
[6]  
Pudiak P., 1991, COMMENT MATH U CAROL, V32, P213
[7]   ON SHIFTING NETWORKS [J].
PUDLAK, P ;
SAVICKY, P .
THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) :415-419
[8]  
RAZBOROV A, UNPUB RIGID MATRICES
[9]  
SHOUP V, 1991, PROCEEDINGS - 32ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, P378, DOI 10.1109/SFCS.1991.185394
[10]  
VALIANT LG, 1977, 1977 P MFCS, P162