论文信息 - On shifting networks

On shifting networks

Abstract We show nonlinear lower bounds on boolean circuits of depth 2, with arbitrary boolean functions and unbounded fan-in, which compute shifts. We give an explicit construction of a certain network related to the above circuits.

Pavel Pudlák | Petr Savický

[1] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[2] Nicholas Pippenger,et al. Superconcentrators of Depth 2 , 1982, J. Comput. Syst. Sci..

[3] Nicholas Pippenger. Communication Networks , 1932, Nature.

[4] A. Yao,et al. Rearrangeable Networks with Limited Depth , 1982 .

[5] Avi Wigderson,et al. Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.

[6] Pavel Pudlák,et al. Communication in bounded depth circuits , 1994, Comb..

[7] Leslie G. Valiant,et al. Shifting Graphs and Their Applications , 1976, J. ACM.