Amortized Communication Complexity
SIAM Journal on Computing
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication complexity
SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Products and Help Bits in Decision Trees
SIAM Journal on Computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Some optimal inapproximability results
Journal of the ACM (JACM)
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Towards proving strong direct product theorems
Computational Complexity
Prior Entanglement, Message Compression and Privacy in Quantum Communication
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
SIAM Journal on Computing
Robust Polynomials and Quantum Algorithms
Theory of Computing Systems
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Direct Product Theorem for Discrepancy
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
The Multiplicative Quantum Adversary
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Complexity measures of sign matrices
Combinatorica
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds in communication complexity based on factorization norms
Random Structures & Algorithms
Algorithmica - Special Issue: Quantum Computation; Guest Editors: Frédéric Magniez and Ashwin Nayak
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Improved Direct Product Theorems for Randomized Query Complexity
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
SIAM Journal on Computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A strong direct product theorem (SDPT) states that solving n instances of a problem requires Omega(n) times the resources for a single instance, even to achieve success probability 2-Ω(n). We prove that quantum communication complexity obeys an SDPT whenever the communication lower bound for a single instance is proved by the generalized discrepancy method, the strongest technique in that model. We prove that quantum query complexity obeys an SDPT whenever the query lower bound for a single instance is proved by the polynomial method, one of the two main techniques in that model. In both models, we prove the corresponding XOR lemmas and threshold direct product theorems.