Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Proceedings of the forty-third annual ACM symposium on Theory of computing
Hi-index | 0.00 |
N/A