The Density of Weakly Complete Problems under Adaptive Reductions

Authors:
Jack H. Lutz;Yong Zhao
Affiliations:
-;-
Venue:
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Year:
1997

Citing 9
Cited 0

Randomness, relativizations, and polynomial reducibilities

Proc. of the conference on Structure in complexity theory
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets

SIAM Journal on Computing
Almost everywhere high nonuniform complexity

Journal of Computer and System Sciences
Measure, Stochasticity, and the Density of Hard Languages

SIAM Journal on Computing
Weak completeness in E and E2

Theoretical Computer Science
With Quasilinear Queries EXP is not Polynomial Time Turing Reducible to Sparse Sets

SIAM Journal on Computing
Resource bounded randomness and weakly complete problems

Theoretical Computer Science
The quantitative structure of exponential time

Complexity theory retrospective II
Equivalence of Measures of Complexity Classes

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Every language that is either (i) hard for E under polynomial-time Turing reductions with n^0.49 queries, or (ii) hard for E2 under polynomial-time Turing reductions with n^0.99 queries, is shown to be exponentially dense. This simultaneously strenghtens results of Lutz and Mayordomo (1994) and Fu (1995).