{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T07:40:14Z","timestamp":1777794014975,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0022-0000(03)00008-4","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:16:03Z","timestamp":1054595763000},"page":"212-243","source":"Crossref","is-referenced-by-count":56,"title":["Random sampling and approximation of MAX-CSPs"],"prefix":"10.1016","volume":"67","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.Fernandez","family":"de la Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kannan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00008-4_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/rsa.10055","article-title":"On the discrepancy of combinatorial rectangles","volume":"21","author":"Alon","year":"2002","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB2","doi-asserted-by":"crossref","unstructured":"N. Alon, W. Fernandez-de-la-Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, in: Proceedings of the 34th ACM STOC, ACM, New York, 2002, pp. 232\u2013239.","DOI":"10.1145\/509907.509945"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB3","unstructured":"N. Alon, A. Shapira, Testing satisfiability, in: Proceedings of the 13th Annual ACM-SIAM SODA, ACM, New York, 2002, pp. 645\u2013654."},{"key":"10.1016\/S0022-0000(03)00008-4_BIB4","doi-asserted-by":"crossref","unstructured":"G. Andersson, L. Engebretsen, Sampling methods applied to dense instances of non-Boolean optimization problems, in: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, October 1998, LNCS, Vol. 1017, Springer, Berlin, 1998, pp. 357\u2013368.","DOI":"10.1007\/3-540-49543-6_28"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1002\/rsa.10041","article-title":"Property testers for dense constraint satisfaction programs on finite domains","volume":"21","author":"Andersson","year":"2002","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB6","doi-asserted-by":"crossref","unstructured":"S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, 1995, pp. 284\u2013293; the full paper appeared in J. Comput. System Sci. 58 (1999) 193\u2013210.","DOI":"10.1006\/jcss.1998.1605"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB7","doi-asserted-by":"crossref","unstructured":"A. Czumaj, C. Sohler, Testing hypergraph coloring, in: Proceedings of the 28th ICALP\u201901, LNCS, Vol. 2076, Springer, Berlin, 2001, pp. 493\u2013505.","DOI":"10.1007\/3-540-48224-5_41"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U","article-title":"MAX-CUT has a randomized approximation scheme in dense graphs","volume":"8","author":"Fernandez-de-la-Vega","year":"1996","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB9","doi-asserted-by":"crossref","unstructured":"A.M. Frieze, R. Kannan, The Regularity Lemma and approximation schemes for dense problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, Burlington, Vermont, 1996, pp. 12\u201320.","DOI":"10.1109\/SFCS.1996.548459"},{"issue":"2","key":"10.1016\/S0022-0000(03)00008-4_BIB10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","article-title":"Quick approximation to matrices and applications","volume":"19","author":"Frieze","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB11","doi-asserted-by":"crossref","unstructured":"M.X. Goemans, D.P. Williamson, 878-Approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 422\u2013431.","DOI":"10.1145\/195058.195216"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB12","first-page":"653","article-title":"Property testing and its connection to learning and approximation","volume":"45","author":"Goldreich","year":"1998","journal-title":"Proceedings of the 37th IEEE FOCS 96, Burlington, Vermont, pp. 339\u2013348; the full paper appeared in J. Amer. Comput. Mach."},{"key":"10.1016\/S0022-0000(03)00008-4_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statis. Assoc."},{"key":"10.1016\/S0022-0000(03)00008-4_BIB14","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0022-0000(03)00008-4_BIB15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.4064\/sm-58-2-197-208","article-title":"On the best constants in the Khinchin Inequality","volume":"58","author":"Szarek","year":"1976","journal-title":"Studia Math."},{"issue":"2","key":"10.1016\/S0022-0000(03)00008-4_BIB16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000084?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000084?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T18:55:52Z","timestamp":1584730552000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0022000003000084"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00008-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}