MAX3SAT is exponentially hard to approximate if NP has positive dimension
Theoretical Computer Science
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Theoretical Computer Science
Theoretical Computer Science
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
The main theorem of this paper is that, for every real number $\alphaThus every $\leq^{P}_{n^{\alpha} - tt}$-hard language for E is exponentially dense. This strengthens Watanabe's 1987 result, that every $\leq^{P}_{(O \log n)-tt}$-hard language for E is exponentially dense. The combinatorial technique used here, the sequentially most frequent query selection, also gives a new, simpler proof of Watanabe's result. The main theorem also has implications for the structure of NP under strong hypotheses. Ogiwara and Watanabe (1991) have shown that the hypothesis $\p\ne\NP$ implies that every $\leq^{P}_{btt}$-hard language for NP is nonsparse (i.e., not polynomially sparse). Their technique does not appear to allow significant relaxation of either the query bound or the sparseness criterion. It is shown here that a stronger hypothesis---namely, that NP does not have measure 0 in exponential time---implies the stronger conclusion that, for every real $\alpha The proof of the main theorem uses a new, very general weak stochasticity theorem, ensuring that almost every language in E is statistically unpredictable by feasible deterministic algorithms, even with linear nonuniform advice.