Circuit complexity: from the worst case to the average case
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Note: Generalized juntas and NP-hard sets
Theoretical Computer Science
Universal distributions and time-bounded kolmogorov complexity
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |