Let (I) be a set of general boolean functions on n variables, such that each function depends on exactly k variables, and each variable can take a value from [1,d]. We say that ¢ is e-far from satisfiable, if one must remove at least en k functions in order to make the set of remaining functions satisfiable. Our main result is that if 4) is e-far from satisfiable, then most of the induced sets of functions, on sets of variables of size c(k,d)/e 2, are not satisfiable, where c (k, d) depends only on k and d. Using the above claim, we obtain similar results for k-SAT and k-NAEQ-SAT. Assume we relax the decision problem of whether an instance of one of the above mentioned problems is satisfiable or not, to the problem of deciding whether an instance is satisfiable or e-far from satisfiable. While the above decision problems are NP-hard, our result implies that we can solve their relaxed versions, that is, distinguishing between satisfiable and e-far from satisfiable instances, in randomized constant time. From the above result we obtain as a special case, previous results of Alon and Krivelevich [3] and of Czumaj and Sohler [8], concerning testing of graphs and hypergraphs colorability. We also discuss the problem of testing whether a graph G can be dcolored, such that it does not contain any copy of a colored graph from a fixed, given set of colored graphs.
The main result of REF states that any constraint satisfaction problem is testable.
Testing satisfiability
SODA '02
Mathematics Computer Science