Cubic Formula Size Lower Bounds Based on Compositions with Majority
暂无分享,去创建一个
[1] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[2] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[3] Ran Raz,et al. Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound , 2017, SIAM J. Comput..
[4] Noam Nisan,et al. The Effect of Random Restrictions on Formula Size , 1993, Random Struct. Algorithms.
[5] Or Meir,et al. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, Electron. Colloquium Comput. Complex..
[6] I. S. Sergeev. Complexity and depth of formulas for symmetric Boolean functions , 2016 .
[7] Johan Hå stad. The Shrinkage Exponent of de Morgan Formulas is 2 , 1998 .
[8] Avishay Tal,et al. Formula lower bounds via the quantum method , 2017, STOC.
[9] Ran Raz,et al. Super-logarithmic depth lower bounds via the direct sum in communication complexity , 1995, computational complexity.
[10] David Zuckerman,et al. Mining Circuit Lower Bound Proofs for Meta-Algorithms , 2014, computational complexity.
[11] Avishay Tal,et al. Shrinkage of De Morgan Formulae by Spectral Techniques , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[12] Russell Impagliazzo,et al. Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[13] Ran Raz,et al. Average-case lower bounds for formula size , 2013, STOC '13.
[14] Ingo Wegener. The critical complexity of all (monotone) Boolean functions and monotone graph properties , 1985, FCT.
[15] V. M. Khrapchenko. Complexity of the realization of a linear function in the class of II-circuits , 1971 .
[16] Andrej Bogdanov. Small bias requires large formulas , 2017, Electron. Colloquium Comput. Complex..
[17] Uri Zwick,et al. Shrinkage of de Morgan formulae under restriction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[18] Claude E. Shannon,et al. The Number of Two‐Terminal Series‐Parallel Networks , 1942 .