{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:23:22Z","timestamp":1648765402090},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0020-0190(90)90188-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"221-226","source":"Crossref","is-referenced-by-count":5,"title":["Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems"],"prefix":"10.1016","volume":"33","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90188-4_BIB1","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"223","author":"Allender","year":"1986"},{"key":"10.1016\/0020-0190(90)90188-4_BIB2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/BF02576644","article-title":"Combinatorial problems over power sets","volume":"16","author":"Ausicllo","year":"1980","journal-title":"Calcolo"},{"key":"10.1016\/0020-0190(90)90188-4_BIB3","article-title":"Relative complexity of evaluating and constructing the optimum of maximization problems","author":"Crescenzi","year":"1988","journal-title":"Proc. 26th Annual Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(90)90188-4_BIB4","series-title":"Tech. Report 1652","article-title":"The complexity of optimization functions","author":"Gasarch","year":"1986"},{"key":"10.1016\/0020-0190(90)90188-4_BIB5","first-page":"69","article-title":"The complexity of optimization problems","author":"Krentel","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90188-4_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(81)90007-4","article-title":"On \u03b3-reducibility versus polynomial time many-one reducibility","volume":"14","author":"Long","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90188-4_BIB7","article-title":"Complexity and Structure","volume":"211","author":"Sch\u00f6ning","year":"1985"},{"key":"10.1016\/0020-0190(90)90188-4_BIB8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901884?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901884?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:17Z","timestamp":1555088297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090901884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0020019090901884"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90188-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}