Property Testers for Dense Constraint Satisfaction Programs on Finite Domains

Random Structures and Algorithms

Volumn 21, Issue 1, 2002, Pages 14-32

  Andersson, Gunnar ^a   Engebretsen, Lars ^b  

^a Prover Technology   (Sweden)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation; Constraint satisfaction; Dense instances; Property testing; Randomized sampling

Indexed keywords

EID: 0036335176     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10041     Document Type: Article

References (14)

1. N. Alon and A. Shapira, Testing satisfiability, Proc 13th Annu ACM-SIAM Symp Discrete Algorithms, San Francisco, 6-8 January 2002, pp 645-654.
2. G. Andersson and L. Engebretsen, Sampling methods applied to dense instances of non-Boolean optimization problems, Proc 2nd Int Workshop Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1017, Barcelona, 8-10 October 1998. Springer-Verlag, New York, pp. 357-368.
3. S. Arora, D. R. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, J Comput Syst Sci 58(1) (1999), 193-210.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J ACM 45(3) (1998), 501-555.
5. S. A. Cook, The complexity of theorem-proving procedures, Conf Record Third Annu ACM Symp Theory of Computing, Shaker Heights, OH, 3-5 May 1971, pp. 151-158.
6. E. Ergün, R. Kumar, and R. Rubinfeld, Fast approximate PCPs, Proc 31st Annu ACM Symp Theory of Computing, Atlanta, GA, 1-4 May 1999, pp. 41-50.
7. W. Fernandez de la Vega, MAX-CUT has a randomized approximation scheme in dense graphs, Random Struct Alg 8(3) (1996), 187-198.
8. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19(2) (1999), 175-220.
9. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J ACM 45(4) (1998), 653-750.
10. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Am Stat Assoc 58(301) (1963), 13-30.
11. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, Cambridge, 1995.
12. C. H. Papadimitriou, Computational complexity, Addison Wesley, Reading, MA, 1994.
13. R. Rubinfeld and M. Sudan, Robust characterizations of polynomials with applications to program testing, SIAM J Comput 25(2) (1996), 252-271.
14. L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, Gadgets, approximation, and linear programming, SIAM J Comput 29(6) (2000), 2074-2097.