Depth-3 Circuits for Inner Product
暂无分享,去创建一个
[1] Peter Frankl,et al. A Variant of the VC-dimension with Applications to Depth-3 Circuits , 2021, ITCS.
[2] Alexander Golovnev,et al. Circuit Depth Reductions , 2018, Electron. Colloquium Comput. Complex..
[3] Shuichi Hirahara,et al. A Duality Between Depth-Three Formulas and Approximation by Depth-Two , 2017, Electron. Colloquium Comput. Complex..
[4] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[5] Emanuele Viola,et al. On the Power of Small-Depth Computation , 2009, Found. Trends Theor. Comput. Sci..
[6] Hartmut Klauck,et al. The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.
[7] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[8] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[9] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[10] Pavel Pudlák,et al. Top-down lower bounds for depth-three circuits , 1995, computational complexity.
[11] Eyal Kushilevitz,et al. Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[12] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.
[13] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[14] Christos H. Papadimitriou,et al. Communication Complexity , 1984, J. Comput. Syst. Sci..
[15] Michael E. Saks,et al. Exponential lower bounds for depth three Boolean circuits , 2000, computational complexity.
[16] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..