Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Slightly beyond Turing's computability for studying genetic programming
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Generation complexity versus distinction complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
| Hi-index | 5.23 |