Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Gap-definable counting classes
Journal of Computer and System Sciences
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
A note on the circuit complexity of PP
Theoretical Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Making Cryptographic Primitives Harder
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |