Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Symmetric polynomials over Zm and simultaneous communication protocols
Journal of Computer and System Sciences - Special issue on FOCS 2003
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Polylogarithmic independence fools AC0 circuits
Journal of the ACM (JACM)
On covering and rank problems for boolean matrices and their applications
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |