Fabulating Otherwise

The OR-SAT problem asks, given Boolean formulae Φ₁,...,Φ_m each of size at most n, whether at least one of the Φ_i's is satisfiable. We show that there is no reduction from OR-SAT to any set A where the length of the output is bounded by a polynomial in n,...

We study the task of hardness amplification which transforms a hard function into a harder one. It is known that in a high complexity class such as exponential time, one can convert worst-case hardness into average-case hardness. However, in a lower ...

The OR-SAT problem asks, given Boolean formulae @f"1,...,@f"m each of size at most n, whether at least one of the @f"i's is satisfiable. We show that there is no reduction from OR-SAT to any set A where the length of the output is bounded by a ...