Lower bounds for the low hierarchy
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGACT News
A structural property of regular frequency computations
Theoretical Computer Science
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Comparing Verboseness for Finite Automata and Turing Machines
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Query complexity of membership comparable sets
Theoretical Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
Theoretical Computer Science
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Computation as an unbounded process
Theoretical Computer Science
| Hi-index | 0.00 |