Computing Requires Larger Formulas than Approximating
暂无分享,去创建一个
[1] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[2] V. M. Khrapchenko. Method of determining lower bounds for the complexity of P-schemes , 1971 .
[3] Or Meir,et al. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, Electron. Colloquium Comput. Complex..
[4] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[5] Or Meir,et al. Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture , 2014, STOC.
[6] Avishay Tal. Shrinkage of De Morgan Formulae from Quantum Query Complexity , 2014, Electron. Colloquium Comput. Complex..
[7] Andris Ambainis,et al. Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer , 2010, SIAM J. Comput..
[8] Pavel Pudlák,et al. Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[9] Russell Impagliazzo,et al. Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[10] Ben Reichardt,et al. Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[11] Uri Zwick,et al. Shrinkage of de Morgan formulae under restriction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[12] Edward Farhi,et al. A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..
[13] Ben Reichardt,et al. Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..
[14] Ran Raz,et al. Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[15] Luca Trevisan,et al. On epsilon-Biased Generators in NC0 , 2003, Electron. Colloquium Comput. Complex..
[16] Noam Nisan,et al. The Effect of Random Restrictions on Formula Size , 1993, Random Struct. Algorithms.
[17] Ben Reichardt,et al. Reflections for quantum query algorithms , 2010, SODA '11.
[18] Troy Lee,et al. Negative weights make adversaries stronger , 2007, STOC '07.
[19] Shachar Lovett,et al. Weight Distribution and List-Decoding Size of Reed–Muller Codes , 2012, IEEE Transactions on Information Theory.
[20] B. M. Fulk. MATH , 1992 .
[21] Johan Håstad. The Shrinkage Exponent of de Morgan Formulas is 2 , 1998, SIAM J. Comput..
[22] Ran Raz,et al. Improved Average-Case Lower Bounds for DeMorgan Formula Size , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[23] Rahul Santhanam,et al. Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[24] Russell Impagliazzo,et al. Fourier Concentration from Shrinkage , 2014, computational complexity.
[25] Avi Wigderson,et al. On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions , 2013, Electron. Colloquium Comput. Complex..
[26] Avishay Tal,et al. Matrix rigidity of random Toeplitz matrices , 2016, computational complexity.
[27] Ran Raz,et al. Average-case lower bounds for formula size , 2013, STOC '13.
[28] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[29] Troy Lee,et al. THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).