On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
暂无分享,去创建一个
[1] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[2] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[3] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[4] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[5] Ran Raz. Tensor-Rank and Lower Bounds for Arithmetic Formulas , 2013, JACM.
[6] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[7] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[8] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[9] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[10] A. Razborov. Communication Complexity , 2011 .
[11] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[12] Anup Rao,et al. Circuits with Medium Fan-In , 2015, Computational Complexity Conference.
[13] Leslie G. Valiant,et al. Exponential lower bounds for restricted monotone circuits , 1983, STOC.
[14] Pavel Pudlák,et al. Top-down lower bounds for depth-three circuits , 1995, computational complexity.
[15] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[16] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[17] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[18] Po-Shen Loh,et al. Probabilistic Methods in Combinatorics , 2009 .
[19] Dieter van Melkebeek,et al. A Survey of Lower Bounds for Satisfiability and Related Problems , 2007, Found. Trends Theor. Comput. Sci..
[20] Emanuele Viola,et al. Hardness amplification proofs require majority , 2008, SIAM J. Comput..
[21] Umesh V. Vazirani,et al. Efficiency considerations in using semi-random sources , 1987, STOC.
[22] Satyanarayana V. Lokam. Complexity Lower Bounds using Linear Algebra , 2009, Found. Trends Theor. Comput. Sci..
[23] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[24] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[25] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.
[26] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[27] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .
[28] Avi Wigderson,et al. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM , 2012, Forum of Mathematics, Sigma.
[29] László Babai,et al. Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy , 1987, Inf. Process. Lett..
[30] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.