Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Information and Computation
The complexity of stochastic sequences
Journal of Computer and System Sciences
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Information and Computation
On the polynomial depth of various sets of random strings
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Lowness for bounded randomness
Theoretical Computer Science
Reconciling data compression and kolmogorov complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters
On the polynomial depth of various sets of random strings
Theoretical Computer Science
| Hi-index | 0.00 |