Theoretical Computer Science
SIGACT news complexity theory column 48
ACM SIGACT News
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
Martingale families and dimension in P
Theoretical Computer Science
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 5.23 |