{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T20:16:09Z","timestamp":1697660169187},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00340-1","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"861-869","source":"Crossref","is-referenced-by-count":16,"title":["MAX3SAT is exponentially hard to approximate if NP has positive dimension"],"prefix":"10.1016","volume":"289","author":[{"given":"John","family":"M. Hitchcock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00340-1_BIB1","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB2","doi-asserted-by":"crossref","unstructured":"E. Dantsin, M. Gavrilovich, E.A. Hirsch, B. Konev, MAX SAT approximation beyond the limits of polynomial-time approximation, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/S0168-0072(01)00052-5"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB3","doi-asserted-by":"crossref","unstructured":"E. Halperin, U. Zwick, Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs, IPCO: 7th Integer Programming and Combinatorial Optimization Conference, Graz, Austria, 1999.","DOI":"10.1007\/3-540-48777-8_16"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB4","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Some optimal inapproximability results, Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 1\u201310.","DOI":"10.1145\/258533.258536"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB5","doi-asserted-by":"crossref","unstructured":"H. Karloff, U. Zwick, A 7\/8-approximation algorithm for MAX 3SAT? 38th Ann. Symp. on Foundations of Computer Science, 1997, pp. 406\u2013415.","DOI":"10.1109\/SFCS.1997.646129"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB6","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00340-1_BIB7","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, Dimension in complexity classes, in: Proc. 15th Ann. IEEE Conf. Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 2000, pp. 158\u2013169.","DOI":"10.1109\/CCC.2000.856747"},{"key":"10.1016\/S0304-3975(01)00340-1_BIB8","first-page":"64","article-title":"Twelve problems in resource-bounded measure","volume":"68","author":"Lutz","year":"1999","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(01)00340-1_BIB9","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539792237498","article-title":"Measure, stochasticity, and the density of hard languages","volume":"23","author":"Lutz","year":"1994","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:18Z","timestamp":1554772938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003401"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00340-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}