The expressive power of voting polynomials
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On relations between counting communication complexity classes
Journal of Computer and System Sciences
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Theoretical Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.02 |