{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:18:05Z","timestamp":1648855085942},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90151-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:27:56Z","timestamp":1034292476000},"page":"11-15","source":"Crossref","is-referenced-by-count":0,"title":["A note on the descriptive complexity of maximization problems"],"prefix":"10.1016","volume":"47","author":[{"given":"Pierluigi","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90151-X_BIB1","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992","journal-title":"Proc. 33rd IEEE FOCS"},{"key":"10.1016\/0020-0190(93)90151-X_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(05)80002-X","article-title":"A note on the approximation of the MAX CLIQUE problem","volume":"40","author":"Crescenzi","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90151-X_BIB3","series-title":"Complexity and Computation","first-page":"43","article-title":"Generalized first-order spectra, and polynomial-time recognizable sets","author":"Fagin","year":"1974"},{"key":"10.1016\/0020-0190(93)90151-X_BIB4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0020-0190(93)90151-X_BIB5","series-title":"Tech. Rept. UCSC-CRL-90-48","article-title":"Logical definability of NP optimization problems","author":"Kolaitis","year":"1990"},{"key":"10.1016\/0020-0190(93)90151-X_BIB6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/SCT.1991.160280","article-title":"Approximation properties of NP minimization classes","author":"Kolaitis","year":"1991","journal-title":"Proc. 6th IEEE Structure in Complexity Theory Conf."},{"key":"10.1016\/0020-0190(93)90151-X_BIB7","first-page":"446","article-title":"Quantifiers and approximation","author":"Panconesi","year":"1990","journal-title":"Proc. 22nd ACM STOC"},{"key":"10.1016\/0020-0190(93)90151-X_BIB8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390151X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390151X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T13:40:33Z","timestamp":1583415633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390151X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002001909390151X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90151-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}