By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...