Abstract
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 depthd superconcentrators for all depths ≥4 (for even depths ≥4 it has been determined before).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon, andP. Pudlák: Superconcentrators of depth 2 and 3,Journ. of Computer and System Science 48(1) (1994), 194–202.
D. Dolev, C. Dwork, N. Pippenger andA. Wigderson: Superconcentrators, generalizers and generalized connectors (preliminary version),Proc. ACM STOC (1983), 42–51.
N. Pippenger: Superconcentrators of depth 2,J. Comput. System Sci. 24 (1982), 82–90.
N. Pippenger: Communications networks, inHandbook of Theoretical Computer Science, Ed. J. van Leeuwen, Elsevier, (1990), 806–833.
N. Pippenger andA. C.-C. Yao: Rearrangeable networks with limited depth,SIAM J. Alg. Disc. Meth. 3 (1981), 411–417.
P. Pudlák andP. Savický: On shifting networks,Theoretical Computer Science 116 (1993), 415–419.
P. Pudlák andZ. Vavřín: Computation of rigidity of ordern 2/r for one simple matrix,Comment. Math. Univ. Carolinae 32(2) (1991), 213–218.
A. A. Razborov: On rigid matrices (in Russian), unpublished.
V. Shoup andR. Smolensky: Lower bounds for polynomial evaluation and interpolation,Proc. IEEE FOCS (1991), 378–383.
L. G. Valiant: Graph-theoretic arguments in low level complexity,Proc. MFCS 1977, Springer-Verlag LNCS, (1977), 162–176.