论文信息 - Lower bounds on the size of bounded depth circuits over a complete basis with logical addition - 字舞流文

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

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

[2] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..

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

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

[5] A. Razborov. Lower bounds on monotone complexity of the logical permanent , 1985 .

[6] Ravi B. Boppana,et al. Threshold functions and bounded deptii monotone circuits , 1984, STOC '84.

[7] Norbert Blum. A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[8] Leslie G. Valiant,et al. Exponential lower bounds for restricted monotone circuits , 1983, STOC.

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

[10] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).