Circuit complexity: from the worst case to the average case
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Performance of Neural Net Heuristics for Maximum Clique on DiverseHighly Compressible Graphs
Journal of Global Optimization
A note on universal distributions for polynomial-time computable distributions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Foundations and Trends® in Theoretical Computer Science
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
Using complexity to protect elections
Communications of the ACM
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Kolmogorov Complexity in Randomness Extraction
ACM Transactions on Computation Theory (TOCT)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.91 |