Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
Theoretical Computer Science
SIGACT news complexity theory column 64
ACM SIGACT News
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
The complexity of unions of disjoint sets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
COLT'07 Proceedings of the 20th annual conference on Learning theory
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Space-efficient informational redundancy
Journal of Computer and System Sciences
Splitting of learnable classes
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mitosis in computational complexity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Separating the notions of self- and autoreducibility
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |