Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A Separation of NP and coNP in Multiparty Communication Complexity
Communication Lower Bounds Using Dual Polynomials
On Quantum-Classical Equivalence for Composed Communication Problems
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Strong direct product theorems for quantum communication and query complexity
No associations
LandOfFree
Alexander A. Sherstov does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Alexander A. Sherstov, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alexander A. Sherstov will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-103135