Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets
Information Processing Letters
Average case complete problems
SIAM Journal on Computing
A comparison of polynomial time completeness notions
Theoretical Computer Science
Cook reducibility is faster than Karp reducibility in NP
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On polynomial-time Turing and many—one completeness in PSPACE
Theoretical Computer Science
On the theory of average case complexity
Journal of Computer and System Sciences
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
On 1-truth-table-hard languages
Theoretical Computer Science
Computability, enumerability, unsolvability
Cook versus Karp-Levin: separating completeness notions if NP is not small
Theoretical Computer Science
P-selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences
Resource bounded randomness and weakly complete problems
Theoretical Computer Science
Structural properties of complete problems for exponential time
Complexity theory retrospective II
Average-case computational complexity theory
Complexity theory retrospective II
Separating NP-Completeness notions under strong Hypotheses
Journal of Computer and System Sciences
Separation of NP-Completeness Notions
SIAM Journal on Computing
Bi-Immunity Separates Strong NP-Completeness Notions
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Coherence, Random-Self-Reducibility, and Self-Correction
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Hi-index | 0.00 |