{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:47Z","timestamp":1747546907442},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0020-0190(97)00112-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"143-145","source":"Crossref","is-referenced-by-count":1,"title":["A nonapproximability result for finite function generation"],"prefix":"10.1016","volume":"63","author":[{"given":"P.","family":"Jonsson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00112-9_BIB1","doi-asserted-by":"crossref","DOI":"10.4086\/cjtcs.1995.004","article-title":"Probabilistically checkable debate systems and nonapproximability of PSPACE-hard functions","author":"Condon","year":"1995","journal-title":"Chicago J. Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00112-9_BIB2","series-title":"The Theory of Groups","author":"Hall","year":"1959"},{"key":"10.1016\/S0020-0190(97)00112-9_BIB3","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"356","article-title":"Generalized CNF satisfiability problems and non-efficient approximability","author":"Hunt","year":"1994"},{"key":"10.1016\/S0020-0190(97)00112-9_BIB4","series-title":"Proc. 18th Ann. Symp. on Foundations of Computer Science","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"key":"10.1016\/S0020-0190(97)00112-9_BIB5","series-title":"Proc. 26th Ann. ACM Symp. on the Theory of Computing","first-page":"468","article-title":"Hierarchical specifications and polynomial-time approximation schemes for PSPACE-complete problems","author":"Marathe","year":"1994"},{"key":"10.1016\/S0020-0190(97)00112-9_BIB6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Illinois J. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001129?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001129?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T20:34:18Z","timestamp":1579034058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0020019097001129"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00112-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}