The pattern matrix method for lower bounds on quantum communication
暂无分享,去创建一个
[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[2] Arkadev Chattopadhyay,et al. Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..
[3] Yaoyun Shi,et al. Quantum communication complexity of block-composed functions , 2007, Quantum Inf. Comput..
[4] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[5] Hartmut Klauck,et al. Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs , 2007, SIAM J. Comput..
[6] George G. Lorentz,et al. Constructive Approximation , 1993, Grundlehren der mathematischen Wissenschaften.
[7] Ronald de Wolf,et al. Improved Quantum Communication Complexity Bounds for Disjointness and Equality , 2001, STACS.
[8] Ronald de Wolf,et al. Strengths and weaknesses of quantum fingerprinting , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[9] Harry Buhrman,et al. On Computation and Communication with Small Bias , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[10] Ronald de Wolf,et al. Communication complexity lower bounds by polynomials , 1999, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[11] Ramamohan Paturi,et al. On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.
[12] Nathan Linial,et al. Learning Complexity vs. Communication Complexity , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[13] Andris Ambainis,et al. The Quantum Communication Complexity of Sampling , 2003, SIAM J. Comput..
[14] Hartmut Klauck. Lower Bounds for Quantum Communication Complexity , 2007, SIAM J. Comput..
[15] Arkadev Chattopadhyay. Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[16] V. Tikhomirov,et al. DUALITY OF CONVEX FUNCTIONS AND EXTREMUM PROBLEMS , 1968 .
[17] Troy Lee,et al. Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.
[18] Alexander A. Sherstov. Separating AC0 from depth-2 majority circuits , 2007, STOC '07.
[19] Troy Lee,et al. A Direct Product Theorem for Discrepancy , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[20] Alexander A. Sherstov,et al. A Lower Bound for Agnostically Learning Disjunctions , 2007, COLT.
[21] Toniann Pitassi,et al. Separating NOF communication complexity classes RP and NP , 2008, Electron. Colloquium Comput. Complex..
[22] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[23] Scott Aaronson,et al. Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.
[24] A. Razborov. Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.
[25] Marvin Minsky,et al. Perceptrons: expanded edition , 1988 .
[26] T. J. Rivlin. An Introduction to the Approximation of Functions , 2003 .
[27] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[28] Nathan Linial,et al. Lower bounds in communication complexity based on factorization norms , 2007, STOC '07.
[29] Hartmut Klauck,et al. Interaction in quantum communication and the complexity of set disjointness , 2001, STOC '01.