The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |