{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:05:19Z","timestamp":1754107519813},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0020-0190(00)00032-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:22:57Z","timestamp":1027650177000},"page":"1-6","source":"Crossref","is-referenced-by-count":13,"title":["On bounded occurrence constraint satisfaction"],"prefix":"10.1016","volume":"74","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00032-6_ID003","series-title":"Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"41","article-title":"A new way to use semidefinite programming with applications to linear equations mod p","author":"Andersson","year":"1999"},{"key":"10.1016\/S0020-0190(00)00032-6_ID004","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0020-0190(00)00032-6_ID005","doi-asserted-by":"crossref","unstructured":"P. Berman, M. Karpinski, On some tighter inapproximability results, in: J. Widermann, P.V.E. Boas, M. Nielsen (Eds.), Proceedings of ICALP 99, Springer Lecture Notes in Computer Sci., Vol. 1644, Springer, Berlin, pp. 200\u2013209","DOI":"10.1007\/3-540-48523-6_17"},{"key":"10.1016\/S0020-0190(00)00032-6_ID006","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating set cover","volume":"Vol. 45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00032-6_ID007","series-title":"Proc. 3rd Israeli Symposium on the Theory of Computing and Systems","first-page":"182","article-title":"Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT","author":"Feige","year":"1995"},{"key":"10.1016\/S0020-0190(00)00032-6_ID008","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"Vol. 42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00032-6_ID009","series-title":"Proc. 29th Annual ACM Symposium on Theory of Computation, El Paso, TX","first-page":"1","article-title":"Some optimal inapproximability results","author":"H\u00e5stad","year":"1997"},{"key":"10.1016\/S0020-0190(00)00032-6_ID010","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"Vol. 9","author":"Johnsson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(00)00032-6_ID011","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"Vol. 43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(00)00032-6_ID012","unstructured":"L. Trevisan, Personal communication"},{"key":"10.1016\/S0020-0190(00)00032-6_ID013","series-title":"Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"201","article-title":"Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint","author":"Zwick","year":"1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000326?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:45:07Z","timestamp":1580870707000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0020019000000326"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00032-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}