Cited By
View all- Bostanci JQian LSpooner NYuen HMohar BShinkar IO'Donnell R(2024)An Efficient Quantum Parallel Repetition Theorem and ApplicationsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649603(1478-1487)Online publication date: 10-Jun-2024
- Jain RKlauck HNayak ALadner RDwork C(2008)Direct product theorems for classical communication complexity via subdistribution boundsProceedings of the fortieth annual ACM symposium on Theory of computing10.1145/1374376.1374462(599-608)Online publication date: 17-May-2008
- palek R(2008)The Multiplicative Quantum AdversaryProceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity10.1109/CCC.2008.9(237-248)Online publication date: 22-Jun-2008
- Show More Cited By