The algorithmic aspects of the regularity lemma
Journal of Algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
SIAM Journal on Discrete Mathematics
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Testing Subgraphs in Large Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
Let Φ 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 ε-far from satisfiable, if one must remove at least εnk functions in order to make the set of remaining functions satisfiable. Our main result is that if Φ is ε-far from satisfiable, then most of the induced sets of functions, on sets of variables of size c(k,d)ε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 ε-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 ε-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 d-colored, such that it does not contain any copy of a colored graph from a fixed, given set of colored graphs.