APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Query complexity in errorless hardness amplification
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.01 |
An errorless heuristic is an algorithm that on all inputs returns either the correct answer or the special symbol\bot, which means "I don't know." A central question in average-case complexity is whether every distributional decision problem in NP has an errorless heuristic scheme: This is an algorithm that, for every \delta \le 0, runs in time polynomial in the instance size and 1/\delta and answers \bot only on a \delta fraction of instances. We study the question from the standpoint of hardness amplification and show that. If every problem in (NP, U) has errorless heuristic circuits that output the correct answer on n^{ - 2/9 + o(1)} -fraction of inputs, then (NP, U) has non-uniform errorless heuristic schemes. If every problem in (NP, U) has randomized errorless heuristic algorithms that output the correct answer on (\log n)^{ - 1/10 + o(1)} -fraction of inputs, then (NP, U) has randomized errorless heuristic schemes. In both cases, the low-end amplification is achieved by analyzing a new sensitivity property of monotone boolean functions in NP. In the non-uniform setting we use a "holographic function" introduced by Benjamini, Schramm, and Wilson (STOC 2005). For the uniform setting we introduce a new function that can be viewed as an efficient version of Talagrand's "random DNF".