Complexity and structure
Sparse sets lowness and highness
SIAM Journal on Computing
Sets with small generalized Kolmogorov complexity
Acta Informatica
On helping by robust oracle machines
Theoretical Computer Science
Information and Computation
Structural complexity 1
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Query-limited reducibilities
On sets truth-table reducible to sparse sets
SIAM Journal on Computing
Kolmogorov complexity and degrees of tally sets
Information and Computation
Separating the low and high hierarchies by oracles
Information and Computation
Bounded queries to SAT and the Boolean hierarchy
Theoretical Computer Science
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
ACM SIGACT News
Semi-membership algorithms: some recent advances
ACM SIGACT News
ACM SIGACT News
Algebraic Properties for P-Selectivity
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Open questions in the theory of semifeasible computation
ACM SIGACT News
Structural properties of oracle classes
Information Processing Letters
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |