暂无分享,去创建一个
[1] Troy Lee,et al. THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[2] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[3] Elias Koutsoupias,et al. Improvements on Khrapchenko's theorem , 1993, Theor. Comput. Sci..
[4] Or Meir,et al. Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation , 2020, computational complexity.
[5] Paul Beame,et al. The quantum query complexity of AC0 , 2010, Quantum Inf. Comput..
[6] A. Razborov. Communication Complexity , 2011 .
[7] Rocco A. Servedio,et al. An Average-Case Depth Hierarchy Theorem for Boolean Circuits , 2017, J. ACM.
[8] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[9] 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..
[10] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[11] Samuel R. Buss,et al. Size-Depth Tradeoffs for Boolean Fomulae , 1994, Inf. Process. Lett..
[12] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[13] Or Meir,et al. Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation , 2017, SIAM J. Comput..
[14] Rocco A. Servedio,et al. An Average-Case Depth Hierarchy Theorem for Boolean Circuits , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[15] Troy Lee,et al. Negative weights make adversaries stronger , 2007, STOC '07.
[16] Mario Szegedy,et al. All Quantum Adversary Methods Are Equivalent , 2005, ICALP.
[17] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.
[18] Ben Reichardt,et al. Span Programs are Equivalent to Quantum Query Algorithms , 2014, SIAM J. Comput..
[19] Or Meir,et al. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, computational complexity.
[20] Ran Raz,et al. The Spectrum of Small DeMorgan Formulas , 2012, Electron. Colloquium Comput. Complex..
[21] Or Meir,et al. Improved Composition Theorems for Functions and Relations , 2018, APPROX-RANDOM.
[22] Toniann Pitassi,et al. Strongly exponential lower bounds for monotone computation , 2017, Electron. Colloquium Comput. Complex..
[23] Avi Wigderson,et al. Composition of the Universal Relation , 1990, Advances In Computational Complexity Theory.
[24] Or Meir,et al. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, Electron. Colloquium Comput. Complex..
[25] HierarchyRan Raz,et al. Separation of the Monotone NC , 1999 .
[26] J. Håstad. The Shrinkage Exponent of de Morgan Formulas is 2 , 1998, SIAM J. Comput..
[27] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[28] The General Adversary Bound: A Survey , 2021, 2104.06380.
[29] Andris Ambainis,et al. Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[30] Avishay Tal,et al. Cubic Formula Size Lower Bounds Based on Compositions with Majority , 2018, Electron. Colloquium Comput. Complex..
[31] Ran Raz,et al. Super-logarithmic depth lower bounds via the direct sum in communication complexity , 1995, computational complexity.
[32] Avishay Tal,et al. Shrinkage of De Morgan Formulae by Spectral Techniques , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[33] 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.
[34] Alexander A. Razborov,et al. Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..
[35] Pavel Pudlák,et al. Top-down lower bounds for depth-three circuits , 1995, computational complexity.
[36] Xi Chen,et al. How to compress interactive communication , 2010, STOC '10.
[37] Ivan Mihajlin,et al. Toward better depth lower bounds: the XOR-KRW conjecture , 2020, Electron. Colloquium Comput. Complex..
[38] Ran Raz,et al. Separation of the Monotone NC Hierarchy , 1999, Comb..
[39] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[40] I. S. Sergeev. Complexity and depth of formulas for symmetric Boolean functions , 2016 .
[41] Noam Nisan,et al. The Effect of Random Restrictions on Formula Size , 1993, Random Struct. Algorithms.
[42] Uri Zwick,et al. Shrinkage of de Morgan formulae under restriction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[43] Johan Håstad. The shrinkage exponent is 2 , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[44] P. Beame. THE QUANTUM QUERY COMPLEXITY OF AC , 2012 .
[45] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[46] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[47] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[48] Ben Reichardt,et al. Reflections for quantum query algorithms , 2010, SODA '11.
[49] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[50] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[51] Uri Zwick,et al. An Extension of Khrapchenko's Theorem , 1991, Inf. Process. Lett..
[52] Andrew M. Childs,et al. The Quantum Query Complexity of Read-Many Formulas , 2012, ESA.
[53] Russell Impagliazzo,et al. Communication complexity towards lower bounds on circuit depth , 2001, computational complexity.
[54] Toniann Pitassi,et al. Communication lower bounds via critical block sensitivity , 2013, STOC.
[55] 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.
[56] Johan Håstad,et al. A Simple Lower Bound for Monotone Clique Using a Communication Game , 1992, Inf. Process. Lett..
[57] Troy Lee,et al. Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.