{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:32Z","timestamp":1759626632969,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,12,3]],"date-time":"1998-12-03T00:00:00Z","timestamp":912643200000},"content-version":"vor","delay-in-days":63,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0304-3975(98)00060-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"131-157","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["A hierarchy based on output multiplicity"],"prefix":"10.1016","volume":"207","author":[{"given":"Ashish V.","family":"Naik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James S.","family":"Royer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(98)00060-7_BIB1","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 Co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(98)00060-7_BIB2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativizations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comput."},{"year":"1989","series-title":"Real Analysis","author":"Dudley","key":"10.1016\/S0304-3975(98)00060-7_BIB3"},{"issue":"2","key":"10.1016\/S0304-3975(98)00060-7_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","article-title":"The complexity of promise problems with applications to public-key cryptography","volume":"61","author":"Even","year":"1984","journal-title":"Inform. and Cont."},{"key":"10.1016\/S0304-3975(98)00060-7_BIB5","series-title":"Proc. 8th Annual IEEE Conf. Structure in Complexity Theory","first-page":"120","article-title":"An oracle builder's toolkit","author":"Fenner","year":"1993"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB6","series-title":"Proc. 11th Annual IEEE Conf. on Computational Complexity","first-page":"213","article-title":"On inverting onto functions","author":"Fenner","year":"1996"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB7","series-title":"Proc. 11th Annual IEEE Conf. Computational Complexity","first-page":"260","article-title":"Complements of multivalued functions","author":"Fenner","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(98)00060-7_BIB8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/S0097539793248305","article-title":"The isomorphism conjecture holds relative to an oracle","volume":"25","author":"Fenner","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(98)00060-7_BIB9","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S0097539793247439","article-title":"On using oracles that compute values","volume":"26","author":"Fenner","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00060-7_BIB10","series-title":"Proc. 5th Int. Symp. on Algorithms and Computation","first-page":"396","article-title":"Separability and one-way functions","volume":"vol. 834","author":"Fortnow","year":"1994"},{"issue":"2","key":"10.1016\/S0304-3975(98)00060-7_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00060-7_BIB12","series-title":"Proc. 18th Annual ACM Symp. on Theory of Computing","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"issue":"4","key":"10.1016\/S0304-3975(98)00060-7_BIB13","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0097539794268315","article-title":"Computing solutions uniquely collapses the polynomial hierarchy","volume":"25","author":"Hemaspaandra","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00060-7_BIB14","series-title":"Complexity Theory Retrospective II","article-title":"The complexity of obtaining solutions for problems in NP","author":"Jenner","year":"1995"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","article-title":"On self-reductbility and weak P-selectivity","volume":"26","author":"Ko","year":"1983","journal-title":"J. Comput. System Sci."},{"year":"1983","series-title":"Three theorems about random oracles from computational complexity theory and recursive function theory","author":"Kurtz","key":"10.1016\/S0304-3975(98)00060-7_BIB16"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB17","series-title":"Proc. 7th Annual IEEE Conf. on Structure in Complexity Theory","first-page":"306","article-title":"Average dependence and random oracles","author":"Kurtz","year":"1992"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/201019.201030","article-title":"The isomorphism conjecture fails relative to a random oracle","volume":"42","author":"Kurtz","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/S0304-3975(98)00060-7_BIB19","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/5925.5938","article-title":"Relativizing complexity classes with cparse oracles","volume":"33","author":"Long","year":"1986","journal-title":"J. Association for Comput. Mach."},{"issue":"3","key":"10.1016\/S0304-3975(98)00060-7_BIB20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(93)90120-I","article-title":"Hard promise problems and nonuniform complexity","volume":"115","author":"Longpr\u00e9","year":"1993","journal-title":"Theoret. Comput. Sci."},{"article-title":"The structural complexity of intractable search functions","year":"1994","author":"Naik","key":"10.1016\/S0304-3975(98)00060-7_BIB21"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(96)00030-0","article-title":"Functions computable with limited access to NP","volume":"58","author":"Ogihara","year":"1996","journal-title":"Inform. Process. Lett."},{"year":"1980","series-title":"Measure and Category","author":"Oxtoby","key":"10.1016\/S0304-3975(98)00060-7_BIB23"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB24","doi-asserted-by":"crossref","DOI":"10.1006\/jcss.1997.1486","article-title":"The isomorphism conjecture holds and one-way functions exist relative to an oracle","author":"Rogers","year":"1997","journal-title":"J. Comput. and System Sci."},{"year":"1966","series-title":"Real and Complex Analysis","author":"Rudin","key":"10.1016\/S0304-3975(98)00060-7_BIB25"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01374525","article-title":"A survey of one-way functions in complexity theory","volume":"25","author":"Selman","year":"1992","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/S0304-3975(98)00060-7_BIB28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","article-title":"A taxonomy of complexity classes of functions","volume":"48","author":"Selman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00060-7_BIB29","series-title":"Proc. 11th Annual IEEE Conf. on Computational Complexity","first-page":"198","article-title":"Much ado about functions","author":"Selman","year":"1996"},{"key":"10.1016\/S0304-3975(98)00060-7_BIB30","series-title":"Proc. 26th Annual IEEE Symp. on Foundations of Comput. Sci.","first-page":"1","article-title":"Separating the polynomial hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:43Z","timestamp":1759625503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0304397598000607"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00060-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hierarchy based on output multiplicity","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00060-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}