Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
Rank, term rank, and chromatic number
Discrete Mathematics
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Gems in decision tree complexity revisited
ACM SIGACT News
| Hi-index | 0.00 |