Random sampling and approximation of MAX-CSP problems
暂无分享,去创建一个
Noga Alon | Marek Karpinski | Wenceslas Fernandez de la Vega | Ravi Kannan | N. Alon | R. Kannan | M. Karpinski | W. F. D. L. Vega
[1] Artur Czumaj,et al. Testing Hypergraph Coloring , 2001, ICALP.
[2] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.
[3] GoldreichOded,et al. Property testing and its connection to learning and approximation , 1998 .
[4] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[5] Noga Alon,et al. Testing satisfiability , 2002, SODA '02.
[6] Alan M. Frieze,et al. The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[7] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[8] David P. Williamson,et al. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.
[9] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[10] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[11] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[12] S. Szarek. On the best constants in the Khinchin inequality , 1976 .
[13] Noga Alon,et al. On the discrepancy of combinatorial rectangles , 2002, Random Struct. Algorithms.
[14] Alan M. Frieze,et al. Quick Approximation to Matrices and Applications , 1999, Comb..
[15] Wenceslas Fernandez de la Vega,et al. MAX-CUT has a randomized approximation scheme in dense graphs , 1996, Random Struct. Algorithms.