论文信息 - Top-down lower bounds for depth 3 circuits

Top-down lower bounds for depth 3 circuits

We present a top-down lower bound method for depth 3 AND-OR-NOT circuits which is simpler than the previous methods and in some cases gives better lower bounds. In particular we prove that depth 3 AND-OR-NOT circuits that compute PARITY resp. MAJORITY require size at least 2/sup 0.618/ .../spl radic/n/ resp. 2/sup 0.849/.../spl radic/n/. This is the first simple proof of a strong lower bound by a top-down argument for non-monotone circuits.<<ETX>>

[1] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[2] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[3] P. Erdös,et al. Intersection Theorems for Systems of Sets , 1960 .

[4] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[5] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[6] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.

[7] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[8] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[9] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..

[10] Mihalis Yannakakis,et al. On monotone formulae with restricted depth , 1984, STOC '84.

[11] Michael Sipser,et al. A Topological View of Some Problems in Complexity Theory , 1984, MFCS.

[12] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.