{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:26:30Z","timestamp":1757629590259,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T00:00:00Z","timestamp":1151625600000},"content-version":"vor","delay-in-days":5142,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0885-064x(92)90011-y","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:01:23Z","timestamp":1099746083000},"page":"93-123","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of verification and computation for IBC problems"],"prefix":"10.1016","volume":"8","author":[{"given":"H","family":"Wo\u017aniakowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1979","author":"Garey","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","key":"10.1016\/0885-064X(92)90011-Y_BIB1"},{"key":"10.1016\/0885-064X(92)90011-Y_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0885-064X(87)90023-9","article-title":"Complexity of Approximation with Relative Error Criterion in Worst, Average, and Probabilistic Settings","volume":"3","author":"Jackowski","year":"1987","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(92)90011-Y_BIB3","article-title":"Lectures Notes in Mathematics","volume":"Vol. 463","author":"Kuo","year":"1975"},{"key":"10.1016\/0885-064X(92)90011-Y_BIB4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0885-064X(92)90012-Z","article-title":"Relaxed Verification for Continuous Problems","volume":"8","author":"Novak","year":"1992","journal-title":"J. Complexity"},{"year":"1988","author":"Traub","series-title":"Information-Based Complexity","key":"10.1016\/0885-064X(92)90011-Y_BIB5"},{"year":"1980","author":"Traub","series-title":"A General Theory of optimal Algorithms","key":"10.1016\/0885-064X(92)90011-Y_BIB6"},{"year":"1981","author":"Vakhania","series-title":"Probability Distributions on Linear Spaces","key":"10.1016\/0885-064X(92)90011-Y_BIB7"},{"key":"10.1016\/0885-064X(92)90011-Y_BIB8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1090\/S0273-0979-1991-15985-9","article-title":"Average Case Complexity of Multivariate Integration","volume":"24","author":"Wo\u017aniakowski","year":"1991","journal-title":"Bull. Amer. Math. Soc. (N.S.)"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9290011Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9290011Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:53:08Z","timestamp":1757515988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9290011Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0885064X9290011Y"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(92)90011-y","relation":{},"ISSN":["0885-064X"],"issn-type":[{"type":"print","value":"0885-064X"}],"subject":[],"published":{"date-parts":[[1992,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity of verification and computation for IBC problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0885-064X(92)90011-Y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}