Baire Category and Nowhere Differentiability for Feasible Real Functions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
SIGACT news complexity theory column 48
ACM SIGACT News
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
A note on dimensions of polynomial size circuits
Theoretical Computer Science
Generic density and small span theorem
Information and Computation
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
Resource-bounded measure on probabilistic classes
Information Processing Letters
Martingale families and dimension in P
Theoretical Computer Science
Turing degrees of reals of positive effective packing dimension
Information Processing Letters
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Automatic forcing and genericity: on the diagonalization strength of finite automata
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Functions that preserve p-randomness
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Functions that preserve p-randomness
Information and Computation
Hi-index | 0.00 |